This paper presented a method for navigation of lunar rover. This method used the real lunar data to model the virtual terrain. In addition, this method not onle considers uncertainty of sensor data, and does integrate directional slip prediction into the path planning algorithm resolving the issue of emerging higher-level behaviors such as planning a path with switch-backs up a slope. Simulati...

Software development processes are highly creative, and subject to frequent changes-making it hard to plan and schedule these processes in advance. Also, distributed projects cannot be planned centrally, especially if the involved parties are individual companies with their own areas of responsibility (as is the case in virtual Software corporations). On the other hand, certain aspects of the o...

Planning is designing the behavior of an agent. The classical theory of planning assumes that the planner has perfect information, and needs to bring about a deenite result, by nding a series of actions that brings it about. These classical assumptions have been questioned, but are quite reasonable for many engineering applications. The problem is that traditional algorithms, while elegant, are...

Human-like robots are useful in many areas such as deep sea mining and space applications. An efficient motion planning algorithm for these type of robots will be helpful in achieving task level programming. In this paper we present a new efficient algorithm that has successfully computer collision free motions for anthropometric figures with many degrees of freedom within a clustered environme...

Explicit communication planning is an increasing necessity for agent systems. Furthermore, there has also been a renewed interest in using classical planning to perform this planning in addition to physical actions in a goal-directed way. Existing approaches, however, are not applicable to a broad spectrum of domains. We present several generic pre-processing strategies and adaptations of the F...

We propose a novel motion planning algorithm based on adaptive random walks. The proposed algorithm turns out to be easy to implement and the solution it produces can be easily and efficiently optimized. Furthermore the algorithm can incorporate adaptive components, so that the developer is not required to specify all the parameters of the random distributions involved, and the algorithm itself...

AI planning systems tend to be disembodied and are not situated within the environment for which plans are generated, thus losing information concerning the interaction between the system and its environment. This paper argues that such information may potentially be valuable in constraining plan formulation, and presents both an agentand domainindependent architecture that extends the classica...

Commitments play a central role in multi-agent coordination. However, they are inherently uncertain and it is important to take these uncertainties into account during planning and scheduling. This paper addresses the problem of handling the uncertainty in commitments. We propose a new model of commitment that incorporates the uncertainty, the use of contingency analysis to reduce the uncertain...

Many potential real-world planning applications are on the border of planning and scheduling. Consider a group of robots (like NASA’s Mars Rovers), that can maneuver over a designated area, perform soil tests, and can take pictures of interesting objects. There are many temporal and resource constraints that the robots have to satisfy while preforming any given set of tasks. For example, robots...

For 5 years now PDDL has been growing in complexity and size. With the languages success the field of Planning and Scheduling (P&S) has grown in the light of the International Planning Competition (IPC), in both complexity and popularity. It is proposed that now is the time to allow the community, as a whole, to drive the progress of PDDL and to create a community outside that of the competitio...