Enhanced Partial Expansion A*

DOI10.1613/jair.4171zbMath1361.68197OpenAlexW2155992093MaRDI QIDQ5419479

Robert C. Holte, Meir Goldenberg, Guni Sharon, Roni Stern, Ariel Felner, Jonathan Schaeffer, Nathan R. Sturtevant

Publication date: 10 June 2014

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4171

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

Heuristic search for one-to-many shortest path queries ⋮ Branch-and-cut-and-price for multi-agent path finding ⋮ Priority inheritance with backtracking for iterative multi-agent path finding ⋮ Shadoks Approach to Low-Makespan Coordinated Motion Planning ⋮ Batch repair actions for automated troubleshooting ⋮ Rational deployment of multiple heuristics in optimal state-space search ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Pairwise symmetry reasoning for multi-agent path finding search ⋮ Regarding Goal Bounding and Jump Point Search ⋮ Safe Multi-Agent Pathfinding with Time Uncertainty ⋮ Subdimensional expansion for multirobot path planning ⋮ Conflict-based search for optimal multi-agent pathfinding

This page was built for publication: Enhanced Partial Expansion A*