Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, CCen_US
dc.contributor.authorPan, CCen_US
dc.contributor.authorChuang, JHen_US
dc.date.accessioned2014-12-08T15:26:07Z-
dc.date.available2014-12-08T15:26:07Z-
dc.date.issued2003en_US
dc.identifier.isbn0-7803-7736-2en_US
dc.identifier.issn1050-4729en_US
dc.identifier.urihttp://hdl.handle.net/11536/18524-
dc.description.abstractThis paper proposes a novel path planning algorithm of 3-D articulated robots with moving bases based on a generalized potential field model. The approach computes, similar to that done in electrostatics, repulsive force and torque between charged objects. A collision-free path can be obtained by locally adjusting the robot configuration to search for minimum potential configurations using these force and torque. The proposed approach is efficient since these potential gradients are analytically tractable. In order to speedup the computation, a sequential planning strategy is adopted. Simulation results show that the proposed algorithm works well, in terms of collision avoidance and computation efficiency.en_US
dc.language.isoen_USen_US
dc.titleA novel potential-based path planning of 3-D articulated robots with moving basesen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2003 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, PROCEEDINGSen_US
dc.citation.spage3365en_US
dc.citation.epage3370en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000187419900540-
Appears in Collections:Conferences Paper