( en | de | ru )

 

Disambiguation of "Kumar, T. K. Satish"

Author of the publication

copydeleteadd this publication to your clipboard
Local Search on Trees and a Framework for Automated Construction Using Multiple Identical Robots: (Extended Abstract).

, , , , and . AAMAS, page 1301-1302. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Satish Kumar Bidani

Satish Kumar Jain

Satish Kumar Anand

Satish Kumar Anand

Satish Kumar Shukla

 

Other publications of authors with the same name

Lifting Techniques for Weighted Constraint Satisfaction Problems.. ISAIM, (2008)Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers., , , , and . CoRR, (2019)Multi-agent path finding with mutex propagation., , , , and . Artif. Intell., (2022)A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints., , , and . AAAI, page 2308-2314. AAAI Press, (2014)Conflict-Based Search for the Virtual Network Embedding Problem., , , , and . ICAPS, page 423-433. AAAI Press, (2022)Optimal and Bounded-Suboptimal Multi-Agent Motion Planning., , , and . SOCS, page 44-51. AAAI Press, (2019)Rapid Randomized Restarts for Multi-Agent Path Finding Solvers., , , , , , and . SOCS, page 148-152. AAAI Press, (2018)A Tree-Based Algorithm for Construction Robots., , and . ICAPS, AAAI, (2014)Min-Max Message Passing and Local Consistency in Constraint Networks., , and . Australasian Conference on Artificial Intelligence, volume 10400 of Lecture Notes in Computer Science, page 340-352. Springer, (2017)The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP., , and . CPAIOR, volume 10335 of Lecture Notes in Computer Science, page 387-402. Springer, (2017)