東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Temporal potential function approach...

The University of Texas at Arlington., Computer Science & Engineering.

Linked to FindBook

Google Book

Amazon

博客來

Temporal potential function approach for path planning in dynamic environments.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Temporal potential function approach for path planning in dynamic environments./
Author:	Gopikrishna, Vamsikrishna.
Description:	88 p.
Notes:	Adviser: Manfred Huber.
Contained By:	Masters Abstracts International47-03.
Subject:	Artificial Intelligence. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1460700
ISBN:	9780549942184

Temporal potential function approach for path planning in dynamic environments.
Gopikrishna, Vamsikrishna.

Temporal potential function approach for path planning in dynamic environments. - 88 p.

Adviser: Manfred Huber.

Thesis (M.S.)--The University of Texas at Arlington, 2008.

A Dynamic environment is one in which either the obstacles or the goal or both are in motion. In most of the current research, robots attempting to navigate in dynamic environments use reactive systems. Although reactive systems have the advantage of fast execution and low overheads, the tradeoff is in performance in terms of the path optimality. Often, the robot ends up tracking the goal, thus following the path taken by the goal, and deviates from this strategy only to avoid a collision with an obstacle it may encounter. In a path planner, the path from the start to the goal is calculated before the robot sets off. This path has to be recalculated if the goal or the obstacles change positions. In the case of a dynamic environment this happens often. One method to compensate for this is to take the velocity of the goal and obstacles into account when planning the path. So instead of following the goal, the robot can estimate where the best position to reach the goal is and plan a path to that location. In this thesis, we propose such a method for path planning in dynamic environments. The proposed method uses a potential function approach that considers time as a variable when calculating the potential value. This potential value for a particular location and time indicates the probability that a robot will collide with an obstacle, assuming that the robot executes a random walk from that location and that time onwards. The robot plans a path by extrapolating the object's motion using current velocities and by calculating the potential values up to a look-ahead limit that is determined by calculating the minimum path length using connectivity evaluation and then determining the utility of expanding the look-ahead limit beyond the minimum path length. The method is fast, so the path can be re-planned with very little overhead if the initial conditions change at execution time. This thesis will discuss how the potential values are calculated and how a suitable look-ahead limit is decided. Finally the performance of the proposed method is analyzed in a simulated environment.

ISBN: 9780549942184Subjects--Topical Terms:

769149
Artificial Intelligence.

Temporal potential function approach for path planning in dynamic environments.
LDR:03095nmm 2200313 a 45 001 891510
005 20101111
008 101111s2008 ||||||||||||||||| ||eng d
020 $a 9780549942184
035 $a (UMI)AAI1460700
035 $a AAI1460700
040 $a UMI $c UMI
100 1 $a Gopikrishna, Vamsikrishna. $3 1065510
245 1 0 $a Temporal potential function approach for path planning in dynamic environments.
300 $a 88 p.
500 $a Adviser: Manfred Huber.
500 $a Source: Masters Abstracts International, Volume: 47-03, page: 1845.
502 $a Thesis (M.S.)--The University of Texas at Arlington, 2008.
520 $a A Dynamic environment is one in which either the obstacles or the goal or both are in motion. In most of the current research, robots attempting to navigate in dynamic environments use reactive systems. Although reactive systems have the advantage of fast execution and low overheads, the tradeoff is in performance in terms of the path optimality. Often, the robot ends up tracking the goal, thus following the path taken by the goal, and deviates from this strategy only to avoid a collision with an obstacle it may encounter. In a path planner, the path from the start to the goal is calculated before the robot sets off. This path has to be recalculated if the goal or the obstacles change positions. In the case of a dynamic environment this happens often. One method to compensate for this is to take the velocity of the goal and obstacles into account when planning the path. So instead of following the goal, the robot can estimate where the best position to reach the goal is and plan a path to that location. In this thesis, we propose such a method for path planning in dynamic environments. The proposed method uses a potential function approach that considers time as a variable when calculating the potential value. This potential value for a particular location and time indicates the probability that a robot will collide with an obstacle, assuming that the robot executes a random walk from that location and that time onwards. The robot plans a path by extrapolating the object's motion using current velocities and by calculating the potential values up to a look-ahead limit that is determined by calculating the minimum path length using connectivity evaluation and then determining the utility of expanding the look-ahead limit beyond the minimum path length. The method is fast, so the path can be re-planned with very little overhead if the initial conditions change at execution time. This thesis will discuss how the potential values are calculated and how a suitable look-ahead limit is decided. Finally the performance of the proposed method is analyzed in a simulated environment.
590 $a School code: 2502.
650 4 $a Artificial Intelligence. $3 769149
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0771
690 $a 0800
690 $a 0984
710 2 $a The University of Texas at Arlington. $b Computer Science & Engineering. $3 1023758
773 0 $t Masters Abstracts International $g 47-03.
790 $a 2502
790 1 0 $a Huber, Manfred, $e advisor
790 1 0 $a Levine, David $e committee member
790 1 0 $a Zaruba, Gergely $e committee member
791 $a M.S.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1460700