default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Andreychuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]Daniil E. Kirilenko, Anton Andreychuk, Aleksandr I. Panov, Konstantin S. Yakovlev
:
Generative models for grid-based and image-based pathfinding. Artif. Intell. 338: 104238 (2025)- 2024
- [j4]Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr I. Panov:
When to Switch: Planning and Learning for Partially Observable Multi-Agent Pathfinding. IEEE Trans. Neural Networks Learn. Syst. 35(12): 17411-17424 (2024) - [c22]Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov:
Decentralized Monte Carlo Tree Search for Partially Observable Multi-Agent Pathfinding. AAAI 2024: 17531-17540 - [c21]Alexey Skrynnik, Anton Andreychuk, Maria Nesterova, Konstantin S. Yakovlev, Aleksandr Panov:
Learn to Follow: Decentralized Lifelong Multi-Agent Pathfinding via Planning and Learning. AAAI 2024: 17541-17549 - [c20]Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding. IROS 2024: 7996-8001 - [c19]Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract). SOCS 2024: 295-296 - [i22]Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding. CoRR abs/2404.16379 (2024) - [i21]Alexey Skrynnik, Anton Andreychuk, Anatolii Borzilov, Alexander Chernyavskiy, Konstantin S. Yakovlev, Aleksandr Panov:
POGEMA: A Benchmark Platform for Cooperative Multi-Agent Navigation. CoRR abs/2407.14931 (2024) - [i20]Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov, Alexey Skrynnik:
MAPF-GPT: Imitation Learning for Multi-Agent Pathfinding at Scale. CoRR abs/2409.00134 (2024) - 2023
- [c18]Daniil E. Kirilenko, Anton Andreychuk, Aleksandr Panov, Konstantin S. Yakovlev:
TransPath: Learning Heuristics for Grid-Based Pathfinding via Transformers. AAAI 2023: 12436-12443 - [c17]Yelisey Pitanov, Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov:
Monte-Carlo Tree Search for Multi-agent Pathfinding: Preliminary Results. HAIS 2023: 649-660 - [i19]Yelisey Pitanov, Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov:
Monte-Carlo Tree Search for Multi-Agent Pathfinding: Preliminary Results. CoRR abs/2307.13453 (2023) - [i18]Alexey Skrynnik, Anton Andreychuk, Maria Nesterova, Konstantin S. Yakovlev, Aleksandr Panov:
Learn to Follow: Decentralized Lifelong Multi-agent Pathfinding via Planning and Learning. CoRR abs/2310.01207 (2023) - [i17]Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr Panov:
Decentralized Monte Carlo Tree Search for Partially Observable Multi-agent Pathfinding. CoRR abs/2312.15908 (2023) - 2022
- [j3]Konstantin S. Yakovlev, Anton Andreychuk, Juliya Belinskaya, Dmitry Makarov:
Safe Interval Path Planning and Flatness-Based Control for Navigation of a Mobile Robot among Static and Dynamic Obstacles. Autom. Remote. Control. 83(6): 903-918 (2022) - [j2]Anton Andreychuk, Konstantin S. Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern:
Multi-agent pathfinding with continuous time. Artif. Intell. 305: 103662 (2022) - [j1]Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr I. Panov:
Pathfinding in stochastic environments: learning vs planning. PeerJ Comput. Sci. 8: e1056 (2022) - [c16]Ilya Ivanashev, Anton Andreychuk, Konstantin S. Yakovlev:
Analysis of the Anytime MAPF Solvers Based on the Combination of Conflict-Based Search (CBS) and Focal Search (FS). MICAI (1) 2022: 368-382 - [c15]David Zahrádka, Anton Andreychuk, Miroslav Kulich, Konstantin S. Yakovlev:
Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough (Extended Abstract). SOCS 2022: 329-331 - [i16]Alexey Skrynnik, Anton Andreychuk, Konstantin S. Yakovlev, Aleksandr I. Panov:
POGEMA: Partially Observable Grid Environment for Multiple Agents. CoRR abs/2206.10944 (2022) - [i15]Ilya Ivanashev, Anton Andreychuk, Konstantin S. Yakovlev:
Analysis Of The Anytime MAPF Solvers Based On The Combination Of Conflict-Based Search (CBS) and Focal Search (FS). CoRR abs/2209.09612 (2022) - [i14]Daniil E. Kirilenko, Anton Andreychuk, Aleksandr Panov, Konstantin S. Yakovlev:
TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers. CoRR abs/2212.11730 (2022) - 2021
- [c14]Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern:
Improving Continuous-time Conflict Based Search. AAAI 2021: 11220-11227 - [c13]Konstantin S. Yakovlev, Anton Andreychuk:
Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles. ICAPS 2021: 405-414 - [c12]Tomás Rybecký, Miroslav Kulich, Anton Andreychuk, Konstantin S. Yakovlev:
Towards Narrowing the Search in Bounded-Suboptimal Safe Interval Path Planning. SOCS 2021: 136-140 - [c11]Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern:
Improving Continuous-time Conflict Based Search. SOCS 2021: 145-146 - [i13]Anton Andreychuk, Konstantin S. Yakovlev, Eli Boyarski, Roni Stern:
Improving Continuous-time Conflict Based Search. CoRR abs/2101.09723 (2021) - [i12]Konstantin S. Yakovlev, Anton Andreychuk:
Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles. CoRR abs/2104.06681 (2021) - 2020
- [c10]Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Revisiting Bounded-Suboptimal Safe Interval Path Planning. ICAPS 2020: 300-304 - [c9]Konstantin S. Yakovlev, Anton Andreychuk, Tomás Rybecký, Miroslav Kulich:
On the Application of Safe-Interval Path Planning to a Variant of the Pickup and Delivery Problem. ICINCO 2020: 521-528 - [c8]Anton Andreychuk:
Multi-agent Path Finding with Kinematic Constraints via Conflict Based Search. RCAI 2020: 29-45 - [i11]Konstantin S. Yakovlev, Anton Andreychuk, Roni Stern:
Revisiting Bounded-Suboptimal Safe Interval Path Planning. CoRR abs/2006.01195 (2020)
2010 – 2019
- 2019
- [c7]Konstantin S. Yakovlev, Anton Andreychuk, Vitaly Vorobyev:
Prioritized Multi-agent Path Finding for Differential Drive Robots. ECMR 2019: 1-6 - [c6]Konstantin S. Yakovlev, Anton Andreychuk, Juliya Belinskaya, Dmitry Makarov:
Combining Safe Interval Path Planning and Constrained Path Following Control: Preliminary Results. ICR 2019: 310-319 - [c5]Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern:
Multi-Agent Pathfinding with Continuous Time. IJCAI 2019: 39-45 - [i10]Anton Andreychuk, Konstantin S. Yakovlev, Dor Atzmon, Roni Stern:
Multi-Agent Pathfinding (MAPF) with Continuous Time. CoRR abs/1901.05506 (2019) - [i9]Konstantin S. Yakovlev, Anton Andreychuk, Juliya Belinskaya, Dmitry Makarov:
Combining Safe Interval Path Planning and Constrained Path Following Control: Preliminary Results. CoRR abs/1906.06911 (2019) - [i8]Konstantin S. Yakovlev, Anton Andreychuk, Vitaly Vorobyev:
Prioritized Multi-agent Path Finding for Differential Drive Robots. CoRR abs/1911.10578 (2019) - 2018
- [c4]Anton Andreychuk, Konstantin S. Yakovlev:
Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning. AAMAS 2018: 2177-2179 - [c3]Anton Andreychuk, Konstantin S. Yakovlev:
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles. ICR 2018: 13-22 - [i7]Anton Andreychuk, Konstantin S. Yakovlev:
Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning. CoRR abs/1805.01270 (2018) - [i6]Anton Andreychuk, Konstantin S. Yakovlev:
Path Finding for the Coalition of Co-operative Agents Acting in the Environment with Destructible Obstacles. CoRR abs/1807.00771 (2018) - [i5]Anton Andreychuk, Konstantin S. Yakovlev:
Multi-robot Path Planning in Well-formed Infrastructures: Prioritized Planning vs. Prioritized Wait Adjustment (Preliminary Results). CoRR abs/1807.01909 (2018) - [i4]Anton Andreychuk, Natalia Soboleva, Konstantin S. Yakovlev:
eLIAN: Enhanced Algorithm for Angle-constrained Path Finding. CoRR abs/1811.00797 (2018) - 2017
- [c2]Konstantin S. Yakovlev, Anton Andreychuk:
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm. ICAPS 2017: 586- - [c1]Anton Andreychuk, Konstantin S. Yakovlev:
Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments. ICR 2017: 1-10 - [i3]Konstantin S. Yakovlev, Anton Andreychuk:
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm. CoRR abs/1703.04159 (2017) - [i2]Anton Andreychuk, Konstantin S. Yakovlev:
Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments. CoRR abs/1707.06607 (2017) - 2016
- [i1]Konstantin S. Yakovlev, Anton Andreychuk:
Resolving Spatial-Time Conflicts In A Set Of Any-angle Or Angle-constrained Grid Paths. CoRR abs/1608.02763 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
