( 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

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks., , , and . AAMAS, page 837-845. ACM, (2017)On the Tractability of Smooth Constraint Satisfaction Problems.. CPAIOR, volume 3524 of Lecture Notes in Computer Science, page 304-319. Springer, (2005)Multi-Agent Path Finding with Deadlines., , , , , and . IJCAI, page 417-423. ijcai.org, (2018)Distributed Reinforcement Learning for Multi-robot Decentralized Collective Construction., , , , , and . DARS, volume 9 of Springer Proceedings in Advanced Robotics, page 35-49. Springer, (2018)Synergy between Compositional Modeling and Bayesian Networks.. SARA, volume 1864 of Lecture Notes in Computer Science, page 324-325. Springer, (2000)Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints.. AAAI, page 74-79. AAAI Press, (2006)Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem., , , , and . AAAI, page 3166-3173. AAAI Press, (2016)The FastMap Pipeline for Facility Location Problems., , , , , and . PRIMA, volume 13753 of Lecture Notes in Computer Science, page 417-434. Springer, (2022)Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers., , , , and . AAAI, page 9925-9932. AAAI Press, (2020)Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery., , , , and . AAAI, page 7651-7658. AAAI Press, (2019)