Reduce Artificial Intelligence Planning Effort by using Map-Reduce Paradigm

While several approaches have been developed to enhance the efficiency of hierarchical Artificial Intelligence planning (AI-planning), complex problems in AI-planning are challenging to overcome. To find a solution plan, the hierarchical planner produces a huge search space that may be infinite. A planner whose small search space is likely to be more efficient than a planner produces a large search space. In this paper, we will present a new approach to integrating hierarchical AI-planning with the map-reduce paradigm. In the mapping part, we will apply the proposed clustering technique to divide the hierarchical planning problem into smaller problems, so-called sub-problems. A pre-processing technique is conducted for each sub-problem to reduce a declarative hierarchical planning domain model and then find an individual solution for each so-called sub-problem sub-plan. In the reduction part, the conflict between sub-plans is resolved to provide a general solution plan to the given hierarchical AI-planning problem. Preprocessing phase helps the planner cut off the hierarchical planning search space for each sub-problem by removing the compulsory literal elements that help the hierarchical planner seek a solution. The proposed approach has been fully implemented successfully, and some experimental results findings will be provided as proof of our approach's substantial improvement inefficiency.

Organic chemistry synthesis problem as artificial intelligence planning.

This thesis formulates organic chemistry synthesis problems as Artificial Intelligence planning problems and uses a combination of techniques developed in the field of planning to solve organic synthesis problems. To this end, a methodology for axiomatizing organic chemistry is developed, which includes axiomatizing molecules and functional groups, as well as two approaches for representing chemical reactions in a logical language amenable to reasoning. A novel algorithm for planning specific to organic chemistry is further developed, based on which a planner capable of identifying 75 functional groups and chemical classes is implemented with a knowledge base of 55 generic chemical reactions. The performance of the planner is empirically evaluated on two sets of benchmark problems and analytically compared with a number of competing algorithms. v

Organic chemistry synthesis problem as artificial intelligence planning.

This thesis formulates organic chemistry synthesis problems as Artificial Intelligence planning problems and uses a combination of techniques developed in the field of planning to solve organic synthesis problems. To this end, a methodology for axiomatizing organic chemistry is developed, which includes axiomatizing molecules and functional groups, as well as two approaches for representing chemical reactions in a logical language amenable to reasoning. A novel algorithm for planning specific to organic chemistry is further developed, based on which a planner capable of identifying 75 functional groups and chemical classes is implemented with a knowledge base of 55 generic chemical reactions. The performance of the planner is empirically evaluated on two sets of benchmark problems and analytically compared with a number of competing algorithms. v

Modified Backward Chaining Algorithm Using Artificial Intelligence Planning IoT Applications

In this chapter, an automated planning algorithm has been proposed for IoT-based applications. A plan is a sequence of activities that leads to a goal or sub-goals. The sequence of sub-goals leads to a particular goal. The plans can be formulated using forward chaining where actions lead to goals or by backward chaining where goals lead to actions. Another method of planning is called partial order planning where all actions and sub-goals are not illustrated in the plan and left incomplete. When many IoT devices are interconnected, based on the tasks and activities involved resource allocation has to be optimized. An optimal plan is one where the total plan length is minimum, and all actions consume similar quantum of resources to achieve a goal. The scheduling cost incurred by way of resource allocation would be minimum. Compared to the existing algorithms L2-Plan (Learn to Plan) and API, the algorithm developed in this work improves optimality of resources by 14% and 36%, respectively.

A Synergy of Semantic and Context Awareness for Service Composition in Ubiquitous Environment

Service composition in an important facet in service oriented architecture, it’s about the idea of assembling atomic services to satisfy a demand rather than building new applications from ‘scratch’, From the user’s perspective it’s a complex task due to the increasing number of services in the web and their heterogeneity. This complexity is increasing in the internet of Things era wehere computing devices are everywhere. In this work we propose an approach for composition of context aware services in a semantic manner, Artificial Intelligence planning is used to automate the composition starting from a defined objectif containing user request and context parameters. Service are described by extending OWL-S with contextual conditions. The proposed architecture was evaluated through an e-health scenario where chronic patients can benefit from a remote and automated medical supervision and emergency handling.