Robot motion planning in a cluttered environment requires knowledge about robot shape and size. These robot characteristics in uence system performance eventhough most motion planning methods do not consider them. This paper presents an ongoing work that studies general motion planning techniques in combination with knowledge related to robot shape and size. The system acquires knowledge and le...

In the object-oriented paradigm, a real-world entity is modeled as an instance and operations applicable to the objects. In this paper the major features of subtyping mechanism and the main type of hierarchies in the Object Model are presented. The application of planning techniques in objectoriented design is specified and further developed by defining a generalized algorithm of the Planner an...

Formulating knowledge for use in AI Planning engines is currently something of an ad-hoc process, where the skills of knowledge engineers and the tools they use may significantly influence the quality of the resulting planning application. There is little in the way of guidelines or standard procedures, however, for knowledge engineers to use when formulating knowledge into planning domain lang...

Although AI planning techniques can poten tially be useful in several manufacturing do mains this potential remains largely unreal ized In order to adapt AI planning techniques to manufacturing it is important to develop more realistic and robust ways to address issues important to manufacturing engineers Fur thermore by investigating such issues AI re searchers may be able to discover principl...

Low-level motion planning techniques must be combined with high-level task planning formalisms in order to generate realistic plans that can be carried out by humans and robots. Previous attempts to integrate these two planning formalisms mostly used either Classical Planning or HTN Planning. Recently, we developed Hierarchical Goal Networks (HGNs), a new hierarchical planning formalism that co...

Completion of partial plans is a subtask for many planning techniques such as plan reusing, replanning and accomplishing complex user goals. The new generation of fast planners such as Graphplan, Satplan and others, is characterized by very efficent planning algorithms which exploit techniques of multiple plans representation. Unfortunately it is fairly difficult to give Graphplan a partial pla...

The Bug algorithm is a local path planning methodology which detects the nearest obstacle as a mobile robot moves towards a target with limited information about the environment. It uses obstacle border as guidance toward the target. In Bug algorithm, the robot circumnavigates the obstacle till it finds certain condition to fulfill algorithm criteria to leave the obstacle toward target point. T...

My PhD research is focused on Web Service Composition through the use of AI planning techniques, considering the domain as an inherently non-deterministic one. The main goal of my research is to build a system in which an end user will be able to search for suitable web services, add new ones, and create new composite ones either manually or automatically. As a practical example of the usefulne...

Enterprise Resource Planning (ERP) is now being hailed as a foundation for the integration of organization-wide information systems. ERP systems link together entire organization’s operations such as accounting, finance, human resources, manufacturing and distribution, etc. Moreover, they also connect the organization to its customers and suppliers through the different stages of the product or...

We describe a novel application of planning in the situation calculus to formalize the evolution of a database under update transactions. In the resulting theory, query evaluation becomes identical to the temporal projection problem. We next deene a class of axioms for which the classical AI planning technique of goal regression provides a sound and complete method for solving the projection pr...