Anton Andreychuk

According to our database, Anton Andreychuk authored at least 27 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding.

Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning.

Alexey Skrynnik, Anton Andreychuk, Maria Nesterova, Konstantin S. Yakovlev, Aleksandr Panov

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Monte-Carlo Tree Search for Multi-agent Pathfinding: Preliminary Results.

Yelisey Pitanov, Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov

Proceedings of the Hybrid Artificial Intelligent Systems - 18th International Conference, 2023

TransPath: Learning Heuristics for Grid-Based Pathfinding via Transformers.

Daniil E. Kirilenko, Anton Andreychuk, Aleksandr Panov, Konstantin S. Yakovlev

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Pathfinding in stochastic environments: learning <i>vs</i> planning.

Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr I. Panov

PeerJ Comput. Sci., 2022

POGEMA: Partially Observable Grid Environment for Multiple Agents.

Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr I. Panov

CoRR, 2022

Multi-agent pathfinding with continuous time.

Anton Andreychuk, Konstantin S. Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern

Artif. Intell., 2022

Safe Interval Path Planning and Flatness-Based Control for Navigation of a Mobile Robot among Static and Dynamic Obstacles.

Konstantin S. Yakovlev, Anton Andreychuk, Juliya Belinskaya, Dmitry Makarov

Autom. Remote. Control., 2022

Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract).

David Zahrádka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Analysis of the Anytime MAPF Solvers Based on the Combination of Conflict-Based Search (CBS) and Focal Search (FS).

Ilya Ivanashev, Anton Andreychuk, Konstantin S. Yakovlev

Proceedings of the Advances in Computational Intelligence, 2022

2021

Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning.

Tomás Rybecký, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles.

Konstantin S. Yakovlev, Anton Andreychuk

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Improving Continuous-time Conflict Based Search.

Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Multi-agent Path Finding with Kinematic Constraints via Conflict Based Search.

Anton Andreychuk

Proceedings of the Artificial Intelligence - 18th Russian Conference, 2020

On the Application of Safe-Interval Path Planning to a Variant of the Pickup and Delivery Problem.

Konstantin S. Yakovlev, Anton Andreychuk, Tomás Rybecký, Miroslav Kulich

Proceedings of the 17th International Conference on Informatics in Control, 2020

Revisiting Bounded-Suboptimal Safe Interval Path Planning.

Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

Multi-Agent Pathfinding (MAPF) with Continuous Time.

Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern

CoRR, 2019

Multi-Agent Pathfinding with Continuous Time.

Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Combining Safe Interval Path Planning and Constrained Path Following Control: Preliminary Results.

Konstantin S. Yakovlev, Anton Andreychuk, Juliya Belinskaya, Dmitry Makarov

Proceedings of the Interactive Collaborative Robotics - 4th International Conference, 2019

Prioritized Multi-agent Path Finding for Differential Drive Robots.

Konstantin S. Yakovlev, Anton Andreychuk, Vitaly Vorobyev

Proceedings of the 2019 European Conference on Mobile Robots, 2019

2018

eLIAN: Enhanced Algorithm for Angle-constrained Path Finding.

Anton Andreychuk, Natalia Soboleva, Konstantin S. Yakovlev

CoRR, 2018

Multi-robot Path Planning in Well-formed Infrastructures: Prioritized Planning vs. Prioritized Wait Adjustment (Preliminary Results).

Anton Andreychuk, Konstantin S. Yakovlev

CoRR, 2018

Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles.

Anton Andreychuk, Konstantin S. Yakovlev

Proceedings of the Interactive Collaborative Robotics - Third International Conference, 2018

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

Anton Andreychuk, Konstantin S. Yakovlev

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments.

Anton Andreychuk, Konstantin S. Yakovlev

Proceedings of the Interactive Collaborative Robotics - Second International Conference, 2017

Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm.

Konstantin S. Yakovlev, Anton Andreychuk

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths.

Konstantin S. Yakovlev, Anton Andreychuk

CoRR, 2016