Multi-Agent Pathfinding with Continuous Time

Andreychuk A.; K. Yakovlev; Atzmon D.; Stern R.

doi:10.24963/ijcai.2019/6

Публикации

?

Multi-Agent Pathfinding with Continuous Time

P. 39–45.

Andreychuk A., Яковлев К. С., Atzmon D., Stern R.

Язык: английский

Полный текст

DOI

Текст на другом сайте

Ключевые слова: heuristic search multi-agent path finding

В книге

Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019)

International Joint Conferences on Artificial Intelligence, 2019.

Decentralized Unlabeled Multi-agent Pathfinding Via Target And Priority Swapping

Дергачев С. А., Яковлев К. С., , in: ECAI 2024. 27th European Conference on Artificial Intelligence, October 19 – 24 October 2024, Santiago de Compostela, Spain – Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024).: IOS Press, 2024. P. 4344–4351.

Добавлено: 11 сентября 2024 г.

Decentralized Unlabeled Multi-agent Navigation in Continuous Space

Дергачев С. А., Яковлев К. С., , in: Interactive Collaborative Robotics. 9th International Conference, ICR 2024, Mexico City, Mexico, October 14–18, 2024, Proceedings.: Cham: Springer, 2024. P. 186–200.

Добавлено: 11 сентября 2024 г.

Towards a Complete Multi-agent Pathfinding Algorithm for Large Agents

Дергачев С. А., Яковлев К. С., , in: Advances in Computational Intelligence. 21st Mexican International Conference on Artificial Intelligence, MICAI 2022, Monterrey, Mexico, October 24–29, 2022, Proceedings* 1.: Cham: Springer, 2022. P. 355–367.

Добавлено: 16 мая 2023 г.

Multi-agent Pathfinding With Continuous Time

Andreychuk A., Яковлев К. С., Surynek P. и др., Artificial Intelligence 2022 Vol. 305 Article 103662

Добавлено: 26 августа 2022 г.

Improving Continuous-time Conflict Based Search

Andreychuk A., Яковлев К. С., Boyarski E. и др., , in: The Thirty-Fifth AAAI Conference on Artificial Intelligence. Technical Tracks 13Vol. 35.: AAAI Press, 2021. P. 11220–11227.

Добавлено: 21 октября 2021 г.

Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World

Laurent F., Schneider M., Scheller C. и др., , in: Proceedings of Machine Learning ResearchVol. 133: Proceedings of the NeurIPS 2020: Competition and Demonstration Track.: PMLR, 2021. P. 275–301.

Добавлено: 6 сентября 2021 г.

Revisiting Bounded-Suboptimal Safe Interval Path Planning

Яковлев К. С., Andreychuk A., Stern R., , in: Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020).: AAAI Press, 2020. P. 300–304.

Добавлено: 21 октября 2020 г.

Prioritized Multi-Agent Path Finding for Differential Drive Robots

Яковлев К. С., Andreychuk A., Vorobyev V., , in: Proceedings of the 2019 European Conference on Mobile Robotics (ECMR 2019).: Prague: IEEE, 2019. P. 1–6.

Добавлено: 15 января 2020 г.

Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning

Andreychuk A., Яковлев К. С., , in: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018).: IFAAMAS, 2018. P. 2177–2179.

Добавлено: 14 августа 2019 г.

Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments

Andreychuk A., Яковлев К. С., , in: Interactive Collaborative Robotics: Second International Conference, ICR 2017, Hatfield, UK, September 12-16, 2017, Proceedings.: Springer, 2017. P. 1–10.

Добавлено: 6 ноября 2017 г.

Automatic Path Planning for an Unmanned Drone with Constrained Flight Dynamics

Яковлев К. С., Makarov D., Scientific and Technical Information Processing 2015 Vol. 42 No. 5 P. 347–358

Добавлено: 17 июля 2017 г.

Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm

Яковлев К. С., Andreychuk A., , in: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017).: Palo Alto: AAAI Press, 2017. P. 586–593.

Добавлено: 17 июля 2017 г.

Grid-based angle-constrained path planning

Яковлев К. С., Baskin E., Hramoin I., , in: Proceedings of the 38th Annual German Conference on Artificial Intelligence (KI 2015), Dresden, Germany, September 21-25, 2015.: Switzerland: Springer, 2015. P. 208–221.

Добавлено: 14 июля 2017 г.

Finetuning Randomized Heuristic Search for 2D Path Planning: Finding the Best Input Parameters for R* Algorithm through Series of Experiments

Яковлев К. С., Baskin E., Hramolin I., , in: Artificial Intelligence: Methodology, Systems, and Applications 16th International Conference, AIMSA 2014, Varna, Bulgaria, September 11-13, 2014. ProceedingsVol. 8722.: Dordrecht, L., Cham, Heidelberg, NY: Springer, 2014. P. 278–285.

Path planning is typically considered in Artificial Intelligence as a graph searching problem and R* is state-of-the-art algorithm tailored to solve it. The algorithm decomposes given path finding task into the series of subtasks each of which can be easily (in computational sense) solved by well-known methods (such as A*). Parameterized random choice is used ...

Добавлено: 24 апреля 2015 г.