Path planning in the presence of dynamic obstacles is a challenging problem due to the added time dimension in the search space. In approaches that ignore the time dimension and treat dynamic obstacles as static, frequent re-planning is unavoidable as the obstacles move, and their solutions are generally sub-optimal and can be incomplete. To achieve both optimality and completeness, it is neces...

nowadays, given different definitions and conceptions on development, territorial planning lends to for various economic, social and geographical aspects, however its defensive and security perspectives have been taken into account to less extent. the present research is aimed to specify passive defense legal requirements in territorial planning through outlining the most important rules on pas...

Healthcare service providers, including those involved in renal disease management, are concerned about the planning of their patients’ treatments. With efforts to automate the planning process, shortcomings are apparent due to the following reasons: (1) current plan representations or ontologies are too fine grained, and (2) current planning systems are often static. To address these issues, w...

The motion planning problem for mobile robots is typically formulated as follows: given a robot and a description of an environment, plan a path of the robot between two specified locations, which is collision-free and satisfies certain optimization criteria. Traditionally there are two approaches to the problem: Off-line planning, which assumes perfectly known and stable environment, and on-li...

Recent breakthroughs in Transmission Network Expansion Planning (TNEP) have demonstrated that the use of robust optimization, as opposed to stochastic programming methods, renders the expansion planning problem computationally tractable for real systems. State-of-the-art robust methods treat this problem as stationary throughout the study period, with all the required investments on expansion o...

Solving problems in dynamic and heterogeneous environments where information sources change its format representation and the data stored along the time is a very complex problem. In previous work we have presented a system called MAPWeb (MultiAgent Planning in the Web) that tries to solve those problems by integrating artificial intelligence planning techniques within the MultiAgent framework....

Planning by Incremental Dynamic Programming Richard S. Sutton GTE Laboratories Incorporated Waltham, MA 02254 [email protected] Abstract This paper presents the basic results and ideas of dynamic programming as they relate most directly to the concerns of planning in AI. These form the theoretical basis for the incremental planning methods used in the integrated architecture Dyna. These incrementa...