UAV online path-planning in a low altitude dangerous environment with dense obstacles, static threats(STs)and dynamic threats(DTs), is a complicated, dynamic, uncertain and real-time problem. We propose a novel method...UAV online path-planning in a low altitude dangerous environment with dense obstacles, static threats(STs)and dynamic threats(DTs), is a complicated, dynamic, uncertain and real-time problem. We propose a novel method to solve the problem to get a feasible and safe path. Firstly STs are modeled based on intuitionistic fuzzy set(IFS) to express the uncertainties in STs. The methods for ST assessment and synthesizing are presented. A reachability set(RS) estimator of DT is developed based on rapidly-exploring random tree(RRT) to predict the threat of DT. Secondly a subgoal selector is proposed and integrated into the planning system to decrease the cost of planning, accelerate the path searching and reduce threats on a path. Receding horizon(RH) is introduced to solve the online path planning problem in a dynamic and partially unknown environment. A local path planner is constructed by improving dynamic domain rapidly-exploring random tree(DDRRT) to deal with complex obstacles. RRT* is embedded into the planner to optimize paths. The results of Monte Carlo simulation comparing the traditional methods prove that our algorithm behaves well on online path planning with high successful penetration probability.展开更多
In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direc...In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direct the planning process. Control-flow actions and conventional actions are planned/scheduled in an integrated way and can interact with each other. Control-flow actions are then executed by the planning engine itself. The approach is illustrated by examples, e.g., for hierarchical planning, in which tasks that are temporally still far away impose only rough constraints on the current schedule, and control-flow tasks ensure that these tasks are refined as they approach the current time. Using the same mechanism, anytime algorithms can change appropriate search methods or parameters over time, and problems like scheduling critical time-outs for garbage collection can be made part of the planning itself.展开更多
基金supported by National Natural Science Foundation of China(61175027)
文摘UAV online path-planning in a low altitude dangerous environment with dense obstacles, static threats(STs)and dynamic threats(DTs), is a complicated, dynamic, uncertain and real-time problem. We propose a novel method to solve the problem to get a feasible and safe path. Firstly STs are modeled based on intuitionistic fuzzy set(IFS) to express the uncertainties in STs. The methods for ST assessment and synthesizing are presented. A reachability set(RS) estimator of DT is developed based on rapidly-exploring random tree(RRT) to predict the threat of DT. Secondly a subgoal selector is proposed and integrated into the planning system to decrease the cost of planning, accelerate the path searching and reduce threats on a path. Receding horizon(RH) is introduced to solve the online path planning problem in a dynamic and partially unknown environment. A local path planner is constructed by improving dynamic domain rapidly-exploring random tree(DDRRT) to deal with complex obstacles. RRT* is embedded into the planner to optimize paths. The results of Monte Carlo simulation comparing the traditional methods prove that our algorithm behaves well on online path planning with high successful penetration probability.
文摘In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direct the planning process. Control-flow actions and conventional actions are planned/scheduled in an integrated way and can interact with each other. Control-flow actions are then executed by the planning engine itself. The approach is illustrated by examples, e.g., for hierarchical planning, in which tasks that are temporally still far away impose only rough constraints on the current schedule, and control-flow tasks ensure that these tasks are refined as they approach the current time. Using the same mechanism, anytime algorithms can change appropriate search methods or parameters over time, and problems like scheduling critical time-outs for garbage collection can be made part of the planning itself.