Conventional approach to solving scheduling problems using constraint technology is based on a static formulation of the problem; in particular all the scheduled activities are expected to be known in advance. Such static formulation is not capable to solve many real-life planning and scheduling problems where the appearance of the activity depends on allocation of other activities during sched...

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...

In the past decades a wide variety of transportation planning issues has come to the fore, addressing both the supply and the demand side. In this context a (seemingly) wide variety of different transportation models both static and dynamic, both microand macrooriented has been developed. The main question to be answered is whether this wide variety of transportation models (e.g., dynamic model...

| This paper addresses dynamic trajectory planning which is deened as trajectory planning for a robot subject to dynamic constraints and moving in a dynamic workspace, i.e. with moving obstacles. To begin with, we propose the novel concept of state-time space as a tool to formulate dynamic trajectory planning problems. The state-time space of a robot is its state space augmented of the time dim...

Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...

This paper is concerned with the problem of finding a time-optimal velocity profile along the predefined path for static formations of mobile robots in order to traverse the path in shortest time and to satisfy, for each mobile robot in the formation, velocity, acceleration, tip over and wheel slip prevention constraints. Time-optimal velocity planning is achieved using so called bang-bang cont...

This paper presents work on sensor-based motion planning in initially unknown dynamic environments. Motion detection and probabilistic motion modeling are combined with a smooth navigation function to perform on-line path planning and replanning in cluttered dynamic environments such as public exhibitions. The SLIP algorithm, an extension of Iterative Closest Point, combines motion detection fr...

Ensuring water availability for multiple needs represents a sustainable development challenge globally. Rigid planning for fixed water supply and reuse targets with estimated demand growth and static assumptions of water availability can prove inflexible in responding to changing conditions. Formal methods to adaptively respond to these challenges are needed, particularly in regions with limite...