( en | de | ru )

 

Disambiguation of "Kumar, T. K. Satish"

Author of the publication

copydeleteadd this publication to your clipboard
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses.

, , , , , and . AAMAS, page 1898-1900. International Foundation for Autonomous Agents and Multiagent Systems, (2020)

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 Anand

 

Other publications of authors with the same name

Multi-Agent Path Finding with Delay Probabilities., , and . CoRR, (2016)Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences.. IJCAI, page 1954-1959. (2007)Multi-agent Path Finding with Capacity Constraints., , and . AI*IA, volume 11946 of Lecture Notes in Computer Science, page 235-249. Springer, (2019)Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers., , , , and . CoRR, (2019)Lifting Techniques for Weighted Constraint Satisfaction Problems.. ISAIM, (2008)A Tree-Based Algorithm for Construction Robots., , and . ICAPS, AAAI, (2014)Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios., , , , , , , , , and . CoRR, (2017)Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery., , , , and . CoRR, (2018)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)