NDLI: Fast C-obstacle query computation for motion planning

Content Provider	IEEE Xplore Digital Library
Author	Liangjun Zhang Kim, Y.J. Varadhan, G. Manocha, D.
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC (Liangjun Zhang)
Abstract	The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targeted towards checking whether a configuration or a 1D path lies in the free space. In this paper, we address the problem of checking whether a C-space primitive or a spatial cell lies completely inside C-obstacle space, without explicitly computing the boundary of C-obstacle. We refer to the problem as the C-obstacle query. We present a fast and conservative algorithm to perform this C-obstacle query. Our algorithm uses the notion of generalized penetration depth that takes into account both translational and rotational motion. We compute the generalized penetration depth for polyhedral objects and compare it with the extent of the motion that the polyhedral robot can undergo. Our approach is general and useful for designing practical algorithms for complete motion planning of rigid robots. We have integrated our query computation algorithm with star-shaped roadmaps (G. Varadhan and D. Manocha, 2005) - a deterministic sampling approach for complete motion planning. We have applied our modified planning algorithm to planar robots undergoing translational and rotational motion in complex 2D environments. Our algorithm is able to perform the C-obstacle query in milliseconds and improves the performance of the complete motion planning algorithm
Sponsorship	IEEE Robotics and Autom. Soc
Starting Page	3035
Ending Page	3040
File Size	581833
Page Count	6
File Format	PDF
ISBN	0780395050
ISSN	10504729
DOI	10.1109/ROBOT.2006.1642163
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-05-15
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Orbital robotics Motion planning Sampling methods Computer science Path planning Robots Motion detection Partitioning algorithms Algorithm design and analysis Road accidents
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

Disconnection proofs for motion planning

Path planning using probabilistic cell decomposition

An adaptive roadmap guided Multi-RRTs strategy for single query path planning

The Gaussian sampling strategy for probabilistic roadmap planners

HPRM: a hierarchical PRM

Hybrid probabilistic RoadMap - Monte Carlo motion planning for closed chain systems with spherical joints

Potential field guide for humanoid multicontacts acyclic motion planning

Combining planning and motion planning

Self-motion graph in path planning for redundant robots along specified end-effector paths

Fast C-obstacle query computation for motion planning

Similar Documents

Disconnection proofs for motion planning

Path planning using probabilistic cell decomposition

An adaptive roadmap guided Multi-RRTs strategy for single query path planning

The Gaussian sampling strategy for probabilistic roadmap planners

HPRM: a hierarchical PRM

Hybrid probabilistic RoadMap - Monte Carlo motion planning for closed chain systems with spherical joints

Potential field guide for humanoid multicontacts acyclic motion planning

Combining planning and motion planning

Self-motion graph in path planning for redundant robots along specified end-effector paths

Fast C-obstacle query computation for motion planning