<P>Given a vector field defined on a robot’s configuration space, in which the vector field represents the system drift, e.g. a wind velocity field, water current flow, or gradient field for some potential function, we present a randomize...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107541820
2014
-
SCOPUS,SCIE
학술저널
1664-1682(19쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P>Given a vector field defined on a robot’s configuration space, in which the vector field represents the system drift, e.g. a wind velocity field, water current flow, or gradient field for some potential function, we present a randomize...
<P>Given a vector field defined on a robot’s configuration space, in which the vector field represents the system drift, e.g. a wind velocity field, water current flow, or gradient field for some potential function, we present a randomized path planning algorithm for reaching a desired goal configuration. Taking the premise that moving against the vector field requires greater control effort, and that minimizing the control effort is both physically meaningful and desirable, we propose an integral functional for control effort, called the <B>upstream criterion</B>, that measures the extent to which a path goes against the given vector field. The integrand of the upstream criterion is then used to construct a rapidly exploring random tree (RRT) in the configuration space, in a way such that random nodes are generated with an a priori specified bias that favors directions indicated by the vector field. The resulting planning algorithm produces better quality paths while preserving many of the desirable features of RRT-based planning, e.g. the Voronoi bias property, computational efficiency, algorithmic simplicity, and straightforward extension to constrained and nonholonomic problems. Extensive numerical experiments demonstrate the advantages of our algorithm vis-à-vis existing optimality criterion-based planning algorithms.</P>