31,289 research outputs found

    STAN4 : a hybrid planning strategy based on subproblem abstraction

    Get PDF
    Planning domains often feature subproblems such as route planning and resource handling. Using static domain analysis techniques, we have been able to identify certain commonly occurring subproblems within planning domains, making it possible to abstract these subproblems from the overall goals of the planner and deploy specialized technology to handle them in a way integrated with the broader planning activities. Using two such subsolvers our hybrid planner, stan4, participated successfully in the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00) planning competition

    A Hybrid Approach to Process Planning: The Urban Traffic Controller Example

    Get PDF
    Automated planning and scheduling are increasingly utilised in solving evsery day planning task. Planning in domains with continuous numeric changes present certain limitations and tremendous challenges to advanced planning algorithms. There are many pertinent examples to the engineering community; however, a case study is provided through the urban traffic controller domain. This paper introduce a novel hybrid approach to state-space planning systems involving a continuous process which can be utilised in several applications. We explore Model Predictive Control (MPC) and explain how it can be introduce into planning with domains containing mixed discrete and continuous state variables. This preserves the numerous benefits of AI Planning approach by the use of explicit reasoning and declarative modelling. It also leverages on the capability of MPC to manage numeric computation and control of continuous processes. The hybrid approach was tested on an urban traffic control network to ascertain it practicability on a continuous domain; the results show its potential to control and optimise heavy volumes of traffic

    Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains

    Full text link
    In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required that each state on the trajectory induced by the execution of plans complies with a given set of global constraints. We approach the computation of plans for such domains as the problem of searching over a deterministic state model. In this model, some of the successor states are obtained by solving numerically the so-called initial value problem over a set of ordinary differential equations (ODE) given by the current plan prefix. These equations hold over time intervals whose duration is determined dynamically, according to whether zero crossing events take place for a set of invariant conditions. The resulting planner, FS+, incorporates these features together with effective heuristic guidance. FS+ does not impose any of the syntactic restrictions on process effects often found on the existing literature on Hybrid Planning. A key concept of our approach is that a clear separation is struck between planning and simulation time steps. The former is the time allowed to observe the evolution of a given dynamical system before committing to a future course of action, whilst the later is part of the model of the environment. FS+ is shown to be a robust planner over a diverse set of hybrid domains, taken from the existing literature on hybrid planning and systems.Comment: 17 page

    CASP Solutions for Planning in Hybrid Domains

    Full text link
    CASP is an extension of ASP that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In this paper, we present CASP solutions for dealing with PDDL+ problems, i.e., encoding from PDDL+ to CASP, and extensions to the algorithm of the EZCSP CASP solver in order to solve CASP programs arising from PDDL+ domains. An experimental analysis, performed on well-known linear and non-linear variants of PDDL+ domains, involving various configurations of the EZCSP solver, other CASP solvers, and PDDL+ planners, shows the viability of our solution.Comment: Under consideration in Theory and Practice of Logic Programming (TPLP

    Progress in AI Planning Research and Applications

    Get PDF
    Planning has made significant progress since its inception in the 1970s, in terms both of the efficiency and sophistication of its algorithms and representations and its potential for application to real problems. In this paper we sketch the foundations of planning as a sub-field of Artificial Intelligence and the history of its development over the past three decades. Then some of the recent achievements within the field are discussed and provided some experimental data demonstrating the progress that has been made in the application of general planners to realistic and complex problems. The paper concludes by identifying some of the open issues that remain as important challenges for future research in planning

    Reformulation in planning

    Get PDF
    Reformulation of a problem is intended to make the problem more amenable to efficient solution. This is equally true in the special case of reformulating a planning problem. This paper considers various ways in which reformulation can be exploited in planning
    • ā€¦
    corecore