Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges

13 March 2018

Papers citing "Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges"

9 / 9 papers shown

Title
LEA: An A Variant Algorithm with Improved Edge Efficiency for Robot Motion Planning Dongliang Zheng Panagiotis Tsiotras 25 0 0 19 Sep 2023
Tightest Admissible Shortest Path Eyal Weiss Ariel Felner G. Kaminka 19 0 0 15 Aug 2023
Variable Grasp Pose and Commitment for Trajectory Optimization Jiahe Pan Kerry He Jia Ming Ong Akansel Cosgun 21 0 0 21 May 2023
Search-Based Task and Motion Planning for Hybrid Systems: Agile Autonomous Vehicles Zlatan Ajanović Enrico Regolin Barys Shyrokau Hana Ćatić M. Horn A. Ferrara 26 18 0 25 Jan 2023
Lazy Incremental Search for Efficient Replanning with Bounded Suboptimality Guarantees J. Lim Mahdi Ghanei Richard Connor Lawson S. Srinivasa Panagiotis Tsiotras 14 1 0 23 Oct 2022
Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks Chen-Ping Yu Sicun Gao 37 47 0 17 Oct 2022
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning Marlin P. Strub Jonathan Gammell 28 52 0 02 Nov 2021
Joint Sampling and Trajectory Optimization over Graphs for Online Motion Planning Kalyan Vasudev Alwala Mustafa Mukadam 24 14 0 13 Nov 2020
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics Marlin P. Strub Jonathan Gammell 16 80 0 16 Feb 2020