Fast optimal and bounded suboptimal Euclidean pathfinding
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Conflict-based search for optimal multi-agent pathfinding.Guni Sharon,Roni Stern,Ariel Felner &Nathan R. Sturtevant -2015 -Artificial Intelligence 219 (C):40-66.
The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon,Roni Stern,Meir Goldenberg &Ariel Felner -2013 -Artificial Intelligence 195 (C):470-495.
Probably bounded suboptimal heuristic search.Roni Stern,Gal Dreiman &Richard Valenzano -2019 -Artificial Intelligence 267 (C):39-57.
Fast and optimal decoding for machine translation.Ulrich Germann,Michael Jahr,Kevin Knight,Daniel Marcu &Kenji Yamada -2004 -Artificial Intelligence 154 (1-2):127-143.
A sufficiently fast algorithm for finding close to optimal clique trees.Ann Becker &Dan Geiger -2001 -Artificial Intelligence 125 (1-2):3-17.
Multi-agent pathfinding with continuous time.Anton Andreychuk,Konstantin Yakovlev,Pavel Surynek,Dor Atzmon &Roni Stern -2022 -Artificial Intelligence 305 (C):103662.
The computational complexity of multi-agent pathfinding on directed graphs.Bernhard Nebel -2024 -Artificial Intelligence 328 (C):104063.
Generative models for grid-based and image-based pathfinding.Daniil Kirilenko,Anton Andreychuk,Aleksandr I. Panov &Konstantin Yakovlev -2025 -Artificial Intelligence 338 (C):104238.
Optimizing pathfinding for goal legibility and recognition in cooperative partially observable environments.Sara Bernardini,Fabio Fagnani,Alexandra Neacsu &Santiago Franco -2024 -Artificial Intelligence 333 (C):104148.
Analytics
Added to PP
2022-11-21
Downloads
17 (#1,261,806)
6 months
2 (#1,372,746)
2022-11-21
Downloads
17 (#1,261,806)
6 months
2 (#1,372,746)
Historical graph of downloads
How can I increase my downloads?Citations of this work
On approximating shortest paths in weighted triangular tessellations.Prosenjit Bose,Guillermo Esteban,David Orden &Rodrigo I. Silveira -2023 -Artificial Intelligence 318 (C):103898.
Home |New books and articles |Bibliographies |Philosophy journals |About PhilPapers |API |Contact us |Code of conduct
PhilPapers logo byAndrea Andrews andMeghan Driscoll.
This site uses cookies and Google Analytics (see ourterms & conditions for details regarding the privacy implications).Use of this site is subject toterms & conditions.
All rights reserved byThe PhilPapers Foundation
Server: philpapers-web-6c559f95d5-w49mj uwo