Research And Accomplishment Of Planning With Rob-action

In this work, we define a new action named rob-action. We research rob-action from two aspects, namely adversarial planning and temporal planning. We also complete a system named RAP. We propose a new pattern for responding to adversarial planning. It dose not need planning recognition, and is faster than the existing pattern. Real time robbing algorithm and Right robbing algorithm are proposed to explain this new pattern. If it executes danger action, it will be adversarial in Real time robbing algorithm. And rob-action executes to stop it going on. For Right robbing algorithm, respond is exact. Because Right robbing algorithm deals with the resources of danger action. By research on resource, a new algorithm is proposed, named Process semaphore planning algorithm. It makes use of process management in OS. Technique of process has been mature. If it is used in planning, it will promote development of planning. Exclusion and synchronization are redefined in this work. Synchronization determinates which action-process should execute before another. Exclusion determinates which action-process could not execute with another together. To deal with planning problem with conditional effect, actions with conditional effect should be extended to a conditional effect tree. If planning can not execute, how to get the goal is the main work in temporal planning with rob-action. Known robbing management algorithm and Unknown robbing management algorithm are proposed. Reverse bridge theorem is proposed in temporal planning. It is a transform method of planning, and it is demonstrated in this work. RAP can decide which rob-action should execute in adversarial planning, and deals with rob-action to make sure the planning goal in temporal planning. By the experiment, RAP fits with the theoretical research.