國立虎尾科技大學 |

Multi-Agent Planning Under Uncertainty.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Multi-Agent Planning Under Uncertainty./
作者:	Asfora, Beatriz Arruda.
面頁冊數:	1 online resource (142 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-03, Section: B.
Contained By:	Dissertations Abstracts International85-03B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9798380318549

Multi-Agent Planning Under Uncertainty.
Asfora, Beatriz Arruda.

Multi-Agent Planning Under Uncertainty. - 1 online resource (142 pages)

Source: Dissertations Abstracts International, Volume: 85-03, Section: B.

Thesis (Ph.D.)--Cornell University, 2023.

Includes bibliographical references

The development of foundational theory and validated algorithms for human-robot teams operating in complex environments, capable of adapting as knowledge of the environment and tasks evolves over time, is a crucial area of research. As data becomes available, there is a need for evolving planning strategies to effectively utilize the information. In the specific context of search and rescue (SaR) scenarios, the high-level goals are to locate survivors, simulate rescue by having humans meet survivors, and minimize the risk to human team members. Ultimately, we seek to improve human-cooperation under uncertainty, as well as team performance and safety. This thesis explores probabilistic driven multi-agent planning approaches, motivated by the challenges posed by SaR missions.First, we investigate the problem of multi-robot non-adversarial search. Uncertainty is present in the victim's true location as only probabilistic information is available a priori. In this context, we seek to find the optimal (or near optimal) path that maximizes the likelihood that our search team can intercept the target given a mission deadline. We prove this problem to be NP-hard, and present the first set of Mixed-Integer Linear Programming (MILP) models to encompass multiple searchers, arbitrary capture ranges, and false negatives simultaneously. The adoption of MILP as a planning paradigm allows to leverage the powerful techniques of modern solvers, yielding better computational performance and, as a consequence, longer planning horizons than the previous state-of-the-art.We build upon the proposed models to incorporate the concept of danger, estimated through a human-robot shared scene perception scheme, allowing for environment knowledge to evolve throughout the mission. The trade-off between risk vs reward is explored through conditional planning, based on the distinct agents' tolerances to danger.We then consider other tasks beyond search in our mission, and ultimately even the planned routes and completion of tasks are modeled in a probabilistic manner. We introduce a novel problem formulation that incorporates probabilistic knowledge of task requirements, dependencies between tasks and their relative locations, heterogeneity of agents' capabilities and an environment that might change as the agents interact with it. Performance assessment of possible mission plans is thus based on probabilistic predictions and tangible reward concepts for team forming, another important aspect of SaR missions.

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

Mode of access: World Wide Web

ISBN: 9798380318549Subjects--Topical Terms:

573171
Computer science.
Subjects--Index Terms:

Mixed-Integer Linear ProgrammingIndex Terms--Genre/Form:

554714
Electronic books.

Multi-Agent Planning Under Uncertainty.
LDR:03848ntm a22003977 4500 001 1145151
005 20240617111356.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798380318549
035 $a (MiAaPQ)AAI30573344
035 $a AAI30573344
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Asfora, Beatriz Arruda. $3 1470378
245 1 0 $a Multi-Agent Planning Under Uncertainty.
264 0 $c 2023
300 $a 1 online resource (142 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: 85-03, Section: B.
500 $a Advisor: Campbell, Mark.
502 $a Thesis (Ph.D.)--Cornell University, 2023.
504 $a Includes bibliographical references
520 $a The development of foundational theory and validated algorithms for human-robot teams operating in complex environments, capable of adapting as knowledge of the environment and tasks evolves over time, is a crucial area of research. As data becomes available, there is a need for evolving planning strategies to effectively utilize the information. In the specific context of search and rescue (SaR) scenarios, the high-level goals are to locate survivors, simulate rescue by having humans meet survivors, and minimize the risk to human team members. Ultimately, we seek to improve human-cooperation under uncertainty, as well as team performance and safety. This thesis explores probabilistic driven multi-agent planning approaches, motivated by the challenges posed by SaR missions.First, we investigate the problem of multi-robot non-adversarial search. Uncertainty is present in the victim's true location as only probabilistic information is available a priori. In this context, we seek to find the optimal (or near optimal) path that maximizes the likelihood that our search team can intercept the target given a mission deadline. We prove this problem to be NP-hard, and present the first set of Mixed-Integer Linear Programming (MILP) models to encompass multiple searchers, arbitrary capture ranges, and false negatives simultaneously. The adoption of MILP as a planning paradigm allows to leverage the powerful techniques of modern solvers, yielding better computational performance and, as a consequence, longer planning horizons than the previous state-of-the-art.We build upon the proposed models to incorporate the concept of danger, estimated through a human-robot shared scene perception scheme, allowing for environment knowledge to evolve throughout the mission. The trade-off between risk vs reward is explored through conditional planning, based on the distinct agents' tolerances to danger.We then consider other tasks beyond search in our mission, and ultimately even the planned routes and completion of tasks are modeled in a probabilistic manner. We introduce a novel problem formulation that incorporates probabilistic knowledge of task requirements, dependencies between tasks and their relative locations, heterogeneity of agents' capabilities and an environment that might change as the agents interact with it. Performance assessment of possible mission plans is thus based on probabilistic predictions and tangible reward concepts for team forming, another important aspect of SaR missions.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
650 4 $a Robotics. $3 561941
650 4 $a Aerospace engineering. $3 686400
653 $a Mixed-Integer Linear Programming
653 $a Optimization
653 $a Planning
653 $a Probability
653 $a Uncertainty
655 7 $a Electronic books. $2 local $3 554714
690 $a 0538
690 $a 0771
690 $a 0984
710 2 $a Cornell University. $b Aerospace Engineering. $3 1464719
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 85-03B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30573344 $z click for full text (PQDT)