Proof planning is an alternative to classical theorem proving. Proof planning is classical planning with no goal interaction. It faces search problems because of long solutions and possibly innnite branching. It is also required to provide plans comprehensible for the user. This article introduces new planning strategies inspired by proof planning examples in order to tackle the search-space-pr...

A key obstacle hampering fielding of AI planning applications is the considerable expense of developing, verifying, updating, and maintaining the planning knowledge base (KB). Planning systems must be able to compare favorably in terms of software lifecycle costs to other means of automation such as scripts or rule-based expert systems. Consequently, in order to field real systems, planning pra...

Planning a collision-free path for a rigid or articulated robot to move from an initial to a final configuration in a static environment is a central problem in robotics and has been extensively addressed over the last. The complexity of the problem is NP-hard (Latombe, 1991). There exist several family sets of variations of the basic problem, that consider flexible robots, and where robots can...

BACKGROUND The purpose of the present study is to compare finite size pencil beam (fsPB) and Monte Carlo (MC) based optimization of lung intensity-modulated stereotactic radiotherapy (lung IMSRT). MATERIALS AND METHODS A fsPB and a MC algorithm as implemented in a biological IMRT planning system were validated by film measurements in a static lung phantom. Then, they were applied for static l...

transmission network expansion planning (tnep) is an important component of power system planning. itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. different methods have been proposed for the solution of the static transmissionnetwork expansion planning (stnep) problem till now. but in all of them, stnep pr...