國立虎尾科技大學 |

Planning with adaptive dimensionality.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Planning with adaptive dimensionality./
Author:	Gochev, Kalin Vasilev.
Description:	1 online resource (182 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 77-12(E), Section: B.
Subject:	Robotics. -
Online resource:	click for full text (PQDT)
ISBN:	9781339928982

Planning with adaptive dimensionality.
Gochev, Kalin Vasilev.

Planning with adaptive dimensionality. - 1 online resource (182 pages)

Source: Dissertation Abstracts International, Volume: 77-12(E), Section: B.

Thesis (Ph.D.)--University of Pennsylvania, 2016.

Includes bibliographical references

Modern systems, such as robots or virtual agents, need to be able to plan their actions in increasingly more complex and larger state-spaces, incorporating many degrees of freedom. However, these high-dimensional planning problems often have low-dimensional representations that describe the problem well throughout most of the state-space. For example, planning for manipulation can be represented by planning a trajectory for the end-effector combined with an inverse kinematics solver through obstacle-free areas of the environment, while planning in the full joint space of the arm is only necessary in cluttered areas. Based on this observation, we have developed the framework for Planning with Adaptive Dimensionality, which makes effective use of state abstraction and dimensionality reduction in order to reduce the size and complexity of the state-space. It iteratively constructs and searches a hybrid state-space consisting of both abstract and non-abstract states. Initially the state-space consists only of abstract states, and regions of non-abstract states are selectively introduced into the state-space in order to maintain the feasibility of the resulting path and the strong theoretical guarantees of the algorithm---completeness and bounds on solution cost sub-optimality. The framework is able to make use of hierarchies of abstractions, as different abstractions can be more effective than others in different parts of the state-space. We have extended the framework to be able to utilize anytime and incremental graph search algorithms. Moreover, we have developed a novel general incremental graph search algorithm---tree-restoring weighted A*, which is able to minimize redundant computation between iterations while efficiently handling changes in the search graph. We have applied our framework to several different domains---navigation for unmanned aerial and ground vehicles, multi-robot collaborative navigation, manipulation and mobile manipulation, and navigation for humanoid robots.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781339928982Subjects--Topical Terms:

561941
Robotics.
Index Terms--Genre/Form:

554714
Electronic books.

Planning with adaptive dimensionality.
LDR:03183ntm a2200337K 4500 001 913644
005 20180622095234.5
006 m o u
007 cr mn||||a|a||
008 190606s2016 xx obm 000 0 eng d
020 $a 9781339928982
035 $a (MiAaPQ)AAI10134965
035 $a (MiAaPQ)upenngdas:12224
035 $a AAI10134965
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Gochev, Kalin Vasilev. $3 1186563
245 1 0 $a Planning with adaptive dimensionality.
264 0 $c 2016
300 $a 1 online resource (182 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 77-12(E), Section: B.
500 $a Advisers: Maxim Likhachev; Alla Safonova.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2016.
504 $a Includes bibliographical references
520 $a Modern systems, such as robots or virtual agents, need to be able to plan their actions in increasingly more complex and larger state-spaces, incorporating many degrees of freedom. However, these high-dimensional planning problems often have low-dimensional representations that describe the problem well throughout most of the state-space. For example, planning for manipulation can be represented by planning a trajectory for the end-effector combined with an inverse kinematics solver through obstacle-free areas of the environment, while planning in the full joint space of the arm is only necessary in cluttered areas. Based on this observation, we have developed the framework for Planning with Adaptive Dimensionality, which makes effective use of state abstraction and dimensionality reduction in order to reduce the size and complexity of the state-space. It iteratively constructs and searches a hybrid state-space consisting of both abstract and non-abstract states. Initially the state-space consists only of abstract states, and regions of non-abstract states are selectively introduced into the state-space in order to maintain the feasibility of the resulting path and the strong theoretical guarantees of the algorithm---completeness and bounds on solution cost sub-optimality. The framework is able to make use of hierarchies of abstractions, as different abstractions can be more effective than others in different parts of the state-space. We have extended the framework to be able to utilize anytime and incremental graph search algorithms. Moreover, we have developed a novel general incremental graph search algorithm---tree-restoring weighted A*, which is able to minimize redundant computation between iterations while efficiently handling changes in the search graph. We have applied our framework to several different domains---navigation for unmanned aerial and ground vehicles, multi-robot collaborative navigation, manipulation and mobile manipulation, and navigation for humanoid robots.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Robotics. $3 561941
650 4 $a Computer science. $3 573171
650 4 $a Artificial intelligence. $3 559380
655 7 $a Electronic books. $2 local $3 554714
690 $a 0771
690 $a 0984
690 $a 0800
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Pennsylvania. $b Computer and Information Science. $3 1179498
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10134965 $z click for full text (PQDT)