Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, CHen_US
dc.contributor.authorLee, JSen_US
dc.contributor.authorChuang, JHen_US
dc.date.accessioned2014-12-08T15:43:36Z-
dc.date.available2014-12-08T15:43:36Z-
dc.date.issued2001-08-01en_US
dc.identifier.issn1094-6977en_US
dc.identifier.urihttp://dx.doi.org/10.1109/5326.971669en_US
dc.identifier.urihttp://hdl.handle.net/11536/29474-
dc.description.abstractThis paper proposes a collision avoidance algorithm to solve the problem of (local) path planning for a three-dimensional (3-D) object moving among polyhedral obstacles. The algorithm is based on a generalized potential model of workspace [1] which assumes that the boundary of every 3-D object is uniformly charged. According to the propose approach, the repulsive force and torque between the moving object an the obstacles due to the above model is used to adjust the position and orientation of the object so as to keep it away from the obstacles while passing through a bottleneck in the free space. Simulation results demonstrate that the path of a 3-D object thus obtained is indeed safe and spatially smooth. The adopted potential field is analytically tractable which makes the path planning efficient.en_US
dc.language.isoen_USen_US
dc.subjectcollision avoidanceen_US
dc.subjectgeneralized potential modelen_US
dc.subjectpath planningen_US
dc.titlePath planning of 3-D objects using a new workspace modelen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/5326.971669en_US
dc.identifier.journalIEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWSen_US
dc.citation.volume31en_US
dc.citation.issue3en_US
dc.citation.spage405en_US
dc.citation.epage410en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000172755000015-
dc.citation.woscount17-
Appears in Collections:Articles


Files in This Item:

  1. 000172755000015.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.