OpenAlex
PricingAboutJobs
Log inGet started
Work

Multi-Agent Pathfinding with Continuous Time

HTML

Year: 2019
Type: article
Source: Artificial Intelligence
DOI: 10.1016/j.artint.2022.103662
Authors: Anton Andreychuk, Konstantin Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern
Institutions: Peoples' Friendship University of Russia, Russian Academy of Sciences, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, National Research University Higher School of Economics, Moscow Institute of Physics and Technology, Ben-Gurion University of the Negev, Czech Technical University in Prague, Palo Alto Research Center
Language: English

Topic: Robotic Path Planning Algorithms
Subfield: Control and Systems Engineering
Field: Engineering
Domain: Physical Sciences
Keywords: multi-agent path finding, continuous time, conflict-based search, collision avoidance, optimal planning, complete algorithms

Open Access status: bronze

Funders: Grantová Agentura České Republiky, Israel Science Foundation, Russian Science Foundation
Awards: G3118402170, intALG-MAPFg: Intelligent Algorithms for Generalized Variants of Multi-Agent Path Finding, G5372517914, G7224045093
OpenAlex ID: W2945025880
FWCI: 7.629
Cites: 101
Cited by: 245
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security