國立虎尾科技大學 |

Robot Motion Planning with Uncertainty and Urgency.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Robot Motion Planning with Uncertainty and Urgency./
作者:	Hou, Brian.
面頁冊數:	1 online resource (88 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-10, Section: B.
Contained By:	Dissertations Abstracts International84-10B.
標題:	Computer engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9798379409319

Robot Motion Planning with Uncertainty and Urgency.
Hou, Brian.

Robot Motion Planning with Uncertainty and Urgency. - 1 online resource (88 pages)

Source: Dissertations Abstracts International, Volume: 84-10, Section: B.

Thesis (Ph.D.)--University of Washington, 2023.

Includes bibliographical references

As robots are introduced to a wider variety of real-world domains-factories, roads, and homes-they must be able to reliably operate with incomplete knowledge of the cluttered-but-structured environment. This dissertation considers the problem of motion planning with uncertainty, where a robot navigates to a goal without knowing the environment's exact obstacle geometry. How can uncertainty be efficiently incorporated into decision-making, without ballooning planning times on computationally-constrained systems and paralyzing robots into indecision? How can algorithms leverage the structure of uncertainty to efficiently plan high-quality paths?This dissertation proposes Bayesian strategies for integrating uncertainty throughout the sampling-based motion planning framework. We formalize uncertainty with an informative posterior distribution over latent environment parameters. In this component, roboticists express their domain expertise about a robot's environment, sensor suite, and interactions between the two. Bayesian planning algorithms aim to navigate the exploration-exploitation tradeoff with respect to this distribution of environments that the robot anticipates seeing at test time.We develop efficient Bayesian search algorithms motivated by regret minimization. This objective captures the urgency of a planner's sequential decision-making process by comparing with the optimal decision-maker at each iteration. The cumulative difference, or regret, penalizes suboptimality at each iteration as well as the time expended to reduce that suboptimality. We demonstrate that algorithms based on posterior sampling are effective for Bayesian anytime lazy motion planning and Bayesian dynamic motion planning.We propose a variational inference algorithm for roadmap optimization, which aims to match the distribution of roadmap samples to the target distribution of collision-free states. We demonstrate that optimized sparse roadmaps concisely approximate the uncertain environment and can be searched more efficiently than conventional uniform or low-discrepancy dense roadmaps.

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

Mode of access: World Wide Web

ISBN: 9798379409319Subjects--Topical Terms:

569006
Computer engineering.
Subjects--Index Terms:

Robot motion planningIndex Terms--Genre/Form:

554714
Electronic books.

Robot Motion Planning with Uncertainty and Urgency.
LDR:03474ntm a22003857 4500 001 1149592
005 20241022112551.5
006 m o d
007 cr bn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798379409319
035 $a (MiAaPQ)AAI30245364
035 $a AAI30245364
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Hou, Brian. $3 1475893
245 1 0 $a Robot Motion Planning with Uncertainty and Urgency.
264 0 $c 2023
300 $a 1 online resource (88 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: Dissertations Abstracts International, Volume: 84-10, Section: B.
500 $a Advisor: Srinivasa, Siddhartha.
502 $a Thesis (Ph.D.)--University of Washington, 2023.
504 $a Includes bibliographical references
520 $a As robots are introduced to a wider variety of real-world domains-factories, roads, and homes-they must be able to reliably operate with incomplete knowledge of the cluttered-but-structured environment. This dissertation considers the problem of motion planning with uncertainty, where a robot navigates to a goal without knowing the environment's exact obstacle geometry. How can uncertainty be efficiently incorporated into decision-making, without ballooning planning times on computationally-constrained systems and paralyzing robots into indecision? How can algorithms leverage the structure of uncertainty to efficiently plan high-quality paths?This dissertation proposes Bayesian strategies for integrating uncertainty throughout the sampling-based motion planning framework. We formalize uncertainty with an informative posterior distribution over latent environment parameters. In this component, roboticists express their domain expertise about a robot's environment, sensor suite, and interactions between the two. Bayesian planning algorithms aim to navigate the exploration-exploitation tradeoff with respect to this distribution of environments that the robot anticipates seeing at test time.We develop efficient Bayesian search algorithms motivated by regret minimization. This objective captures the urgency of a planner's sequential decision-making process by comparing with the optimal decision-maker at each iteration. The cumulative difference, or regret, penalizes suboptimality at each iteration as well as the time expended to reduce that suboptimality. We demonstrate that algorithms based on posterior sampling are effective for Bayesian anytime lazy motion planning and Bayesian dynamic motion planning.We propose a variational inference algorithm for roadmap optimization, which aims to match the distribution of roadmap samples to the target distribution of collision-free states. We demonstrate that optimized sparse roadmaps concisely approximate the uncertain environment and can be searched more efficiently than conventional uniform or low-discrepancy dense roadmaps.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer engineering. $3 569006
650 4 $a Computer science. $3 573171
650 4 $a Robotics. $3 561941
653 $a Robot motion planning
653 $a Bayesian planning algorithms
653 $a Low-discrepancy dense roadmaps
653 $a Computationally-constrained systems
655 7 $a Electronic books. $2 local $3 554714
690 $a 0771
690 $a 0984
690 $a 0464
710 2 $a University of Washington. $b Computer Science and Engineering. $3 1182238
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 84-10B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30245364 $z click for full text (PQDT)