東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Generating plans in Concurrent, Prob...

Li, Li.

FindBook

Google Book

Amazon

博客來

Generating plans in Concurrent, Probabilistic, Over-subscribed domains.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Generating plans in Concurrent, Probabilistic, Over-subscribed domains./
作者:	Li, Li.
面頁冊數:	97 p.
附註:	Source: Dissertation Abstracts International, Volume: 76-10(E), Section: B.
Contained By:	Dissertation Abstracts International76-10B(E).
標題:	Artificial intelligence. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3706303
ISBN:	9781321799699

Generating plans in Concurrent, Probabilistic, Over-subscribed domains.
Li, Li.

Generating plans in Concurrent, Probabilistic, Over-subscribed domains. - 97 p.

Source: Dissertation Abstracts International, Volume: 76-10(E), Section: B.

Thesis (Ph.D.)--Michigan Technological University, 2015.

This item must not be sold to any third party vendors.

Planning in realistic domains typically involves reasoning under uncertainty, operating under time and resource constraints, and finding the optimal subset of goals to work on. Creating optimal plans that consider all of these features is a computationally complex, challenging problem. This dissertation develops an AO* search based planner named CPOAO* (Concurrent, Probabilistic, Over-subscription AO*) which incorporates durative actions, time and resource constraints, concurrent execution, over-subscribed goals, and probabilistic actions. To handle concurrent actions, action combinations rather than individual actions are taken as plan steps. Plan optimization is explored by adding two novel aspects to plans. First, parallel steps that serve the same goal are used to increase the plan's probability of success. Traditionally, only parallel steps that serve different goals are used to reduce plan execution time. Second, actions that are executing but are no longer useful can be terminated to save resources and time. Conventional planners assume that all actions that were started will be carried out to completion. To reduce the size of the search space, several domain independent heuristic functions and pruning techniques were developed. The key ideas are to exploit dominance relations for candidate action sets and to develop relaxed planning graphs to estimate the expected rewards of states. This thesis contributes (1) an AO* based planner to generate parallel plans, (2) domain independent heuristics to increase planner efficiency, and (3) the ability to execute redundant actions and to terminate useless actions to increase plan efficiency.

ISBN: 9781321799699Subjects--Topical Terms:

516317
Artificial intelligence.

Generating plans in Concurrent, Probabilistic, Over-subscribed domains.
LDR:02592nmm a2200277 4500 001 2066536
005 20151106144913.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781321799699
035 $a (MiAaPQ)AAI3706303
035 $a AAI3706303
040 $a MiAaPQ $c MiAaPQ
100 1 $a Li, Li. $3 1036040
245 1 0 $a Generating plans in Concurrent, Probabilistic, Over-subscribed domains.
300 $a 97 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-10(E), Section: B.
500 $a Adviser: Nilufer Onder.
502 $a Thesis (Ph.D.)--Michigan Technological University, 2015.
506 $a This item must not be sold to any third party vendors.
520 $a Planning in realistic domains typically involves reasoning under uncertainty, operating under time and resource constraints, and finding the optimal subset of goals to work on. Creating optimal plans that consider all of these features is a computationally complex, challenging problem. This dissertation develops an AO* search based planner named CPOAO* (Concurrent, Probabilistic, Over-subscription AO*) which incorporates durative actions, time and resource constraints, concurrent execution, over-subscribed goals, and probabilistic actions. To handle concurrent actions, action combinations rather than individual actions are taken as plan steps. Plan optimization is explored by adding two novel aspects to plans. First, parallel steps that serve the same goal are used to increase the plan's probability of success. Traditionally, only parallel steps that serve different goals are used to reduce plan execution time. Second, actions that are executing but are no longer useful can be terminated to save resources and time. Conventional planners assume that all actions that were started will be carried out to completion. To reduce the size of the search space, several domain independent heuristic functions and pruning techniques were developed. The key ideas are to exploit dominance relations for candidate action sets and to develop relaxed planning graphs to estimate the expected rewards of states. This thesis contributes (1) an AO* based planner to generate parallel plans, (2) domain independent heuristics to increase planner efficiency, and (3) the ability to execute redundant actions and to terminate useless actions to increase plan efficiency.
590 $a School code: 0129.
650 4 $a Artificial intelligence. $3 516317
690 $a 0800
710 2 $a Michigan Technological University. $b Computer Science. $3 3170053
773 0 $t Dissertation Abstracts International $g 76-10B(E).
790 $a 0129
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3706303