NDLI: Dynamic Multi-Heuristic A*

Content Provider	IEEE Xplore Digital Library
Author	Islam, F. Narayanan, V. Likhachev, M.
Copyright Year	2015
Description	Author affiliation: Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA (Islam, F.; Narayanan, V.; Likhachev, M.)
Abstract	Many motion planning problems in robotics are high dimensional planning problems. While sampling-based motion planning algorithms handle the high dimensionality very well, the solution qualities are often hard to control due to the inherent randomization. In addition, they suffer severely when the configuration space has several `narrow passages'. Search-based planners on the other hand typically provide good solution qualities and are not affected by narrow passages. However, in the absence of a good heuristic or when there are deep local minima in the heuristic, they suffer from the curse of dimensionality. In this work, our primary contribution is a method for dynamically generating heuristics, in addition to the original heuristic(s) used, to guide the search out of local minima. With the ability to escape local minima easily, the effect of dimensionality becomes less pronounced. On the theoretical side, we provide guarantees on completeness and bounds on suboptimality of the solution found. We compare our proposed method with the recently published Multi-Heuristic A* search, and the popular RRT-Connect in a full-body mobile manipulation domain for the PR2 robot, and show its benefits over these approaches.
Starting Page	2376
Ending Page	2382
File Size	2638792
Page Count	7
File Format	PDF
e-ISBN	9781479969234
DOI	10.1109/ICRA.2015.7139515
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-05-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Robots Heuristic algorithms Search problems Planning Mobile communication Dynamics Euclidean distance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Speeding up heuristic computation in planning with Experience Graphs

Dynamic path planning for mobile robots using chaotic prediction

A New Cost Function Heuristic Applied to A* Based Path Planning in Static and Dynamic Environments

Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm

Kinodynamic motion planning with Space-Time Exploration Guided Heuristic Search for car-like robots in dynamic environments

Improving efficiency in any-angle path-planning algorithms

Autonomous decentralized route planning method and its application to a dynamic route planning

High Performance State Lattice Planning Using Heuristic Look-Up Tables

Trajectory planning for mobile robots in a dynamic environment

Dynamic Multi-Heuristic A*

Similar Documents

Speeding up heuristic computation in planning with Experience Graphs

Dynamic path planning for mobile robots using chaotic prediction

A New Cost Function Heuristic Applied to A* Based Path Planning in Static and Dynamic Environments

Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm

Kinodynamic motion planning with Space-Time Exploration Guided Heuristic Search for car-like robots in dynamic environments

Improving efficiency in any-angle path-planning algorithms

Autonomous decentralized route planning method and its application to a dynamic route planning

High Performance State Lattice Planning Using Heuristic Look-Up Tables

Trajectory planning for mobile robots in a dynamic environment

Dynamic Multi-Heuristic A*