A NEW ALGORITHM FOR PROBABILISTIC PLANNING BASED ON MULTI-OBJECTIVE OPTIMIZATION
With the fast development of Al planning, planning technology has been widely applied to robotics and automated cybernetics. Many researchers pay more and more attention to the uncertainty in AI planning, probabilistic planning is a important branch of uncertainty planning. In realistic domains, probabilistic planning often involves multiple objectives, where it aims to generate optimal set of plans to satisfy all these objectives. To date, most of probabilistic plan algorithms have only focused on single objective formulations that bound one of the objectives by making some unnatural assumptions. In this paper, we focus on the probabilistic planning problem with multiple objectives, and we introduce the multi-objective optimization method into probabilistic planning to define the multi-objective value function, we extend the single objective probabilistic algorithm Learning Depth-First Search (LDFS) to its multi-objective counterpart Multi-objective LDFS (MLDFS).We explain our implemented algorithm, the objective function we redefined, make conclusion and discuss our future work based on this framework.
Probabilistic planning MDPs Objective function LDFS Multi-objective optimization MLDFS
WEN-XIANG GU XIAO-FEI LIU
Department of Computing, Northeast Normal University, ChangChun 130117, China
国际会议
2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)
昆明
英文
1812-1817
2008-07-12（万方平台首次上网日期，不代表论文的发表时间）