NDLI: Planning curvature-constrained paths to multiple goals using circle sampling

Content Provider	IEEE Xplore Digital Library
Author	Lobaton, E. Jinghe Zhang Patil, S. Alterovitz, R.
Copyright Year	2011
Description	Author affiliation: Department of Computer Science, University of North Carolina at Chapel Hill, 27599, USA (Lobaton, E.; Jinghe Zhang; Patil, S.; Alterovitz, R.)
Abstract	We present a new sampling-based method for planning optimal, collision-free, curvature-constrained paths for nonholonomic robots to visit multiple goals in any order. Rather than sampling configurations as in standard sampling-based planners, we construct a roadmap by sampling circles of constant curvature and then generating feasible transitions between the sampled circles. We provide a closed-form formula for connecting the sampled circles in 2D and generalize the approach to 3D workspaces. We then formulate the multigoal planning problem as finding a minimum directed Steiner tree over the roadmap. Since optimally solving the multi-goal planning problem requires exponential time, we propose greedy heuristics to efficiently compute a path that visits multiple goals. We apply the planner in the context of medical needle steering where the needle tip must reach multiple goals in soft tissue, a common requirement for clinical procedures such as biopsies, drug delivery, and brachytherapy cancer treatment. We demonstrate that our multi-goal planner significantly decreases tissue that must be cut when compared to sequential execution of single-goal plans.
Starting Page	1463
Ending Page	1469
File Size	369078
Page Count	7
File Format	PDF
ISBN	9781612843865
ISSN	10504729
e-ISBN	9781612843858
DOI	10.1109/ICRA.2011.5980446
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-05-09
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Needles Planning Bridges Joining processes Robot kinematics Approximation algorithms
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Control and Systems Engineering Electrical and Electronic Engineering Software

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

Planning Curvature-Constrained Paths to Multiple Goals Using Circle Sampling

Planning paths of minimal curvature

Roadmaps using gradient extremal paths

Efficient formation path planning on large graphs

Multi-vehicle path planning in dynamically changing environments

Solving geometric constraints by iterative projections and backprojections

A graph-based approach to multi-robot rendezvous for recharging in persistent tasks

Smooth path planning by using visibility graph-like method

$RDT^{+}:$ A parameter-free algorithm for exact motion planning

Planning curvature-constrained paths to multiple goals using circle sampling

Similar Documents

Planning Curvature-Constrained Paths to Multiple Goals Using Circle Sampling

Planning paths of minimal curvature

Roadmaps using gradient extremal paths

Efficient formation path planning on large graphs

Multi-vehicle path planning in dynamically changing environments

Solving geometric constraints by iterative projections and backprojections

A graph-based approach to multi-robot rendezvous for recharging in persistent tasks

Smooth path planning by using visibility graph-like method

$RDT^{+}:$ A parameter-free algorithm for exact motion planning

Planning curvature-constrained paths to multiple goals using circle sampling