4,423 research outputs found
Building a Truly Distributed Constraint Solver with JADE
Real life problems such as scheduling meeting between people at different
locations can be modelled as distributed Constraint Satisfaction Problems
(CSPs). Suitable and satisfactory solutions can then be found using constraint
satisfaction algorithms which can be exhaustive (backtracking) or otherwise
(local search). However, most research in this area tested their algorithms by
simulation on a single PC with a single program entry point. The main
contribution of our work is the design and implementation of a truly
distributed constraint solver based on a local search algorithm using Java
Agent DEvelopment framework (JADE) to enable communication between agents on
different machines. Particularly, we discuss design and implementation issues
related to truly distributed constraint solver which might not be critical when
simulated on a single machine. Evaluation results indicate that our truly
distributed constraint solver works well within the observed limitations when
tested with various distributed CSPs. Our application can also incorporate any
constraint solving algorithm with little modifications.Comment: 7 page
Progress in AI Planning Research and Applications
Planning has made significant progress since its inception in the 1970s, in terms both of the efficiency and sophistication of its algorithms and representations and its potential for application to real problems. In this paper we sketch the foundations of planning as a sub-field of Artificial Intelligence and the history of its development over the past three decades. Then some of the recent achievements within the field are discussed and provided some experimental data demonstrating the progress that has been made in the application of general planners to realistic and complex problems. The paper concludes by identifying some of the open issues that remain as important challenges for future research in planning
Recommended from our members
Constraint-based adaptation for complex space configuration in building services
In this paper an object-based CAD programming is used to take advantage of standardization to handle the schematic design, sizing and layout planning for ceiling mounted fan coil system in a building ceiling void. In order to deal with more complex geometry and real building size, we have used a hybrid approach combining case-based reasoning and constraint programming techniques. Very often, building services engineers use previous solutions and adapt them to new problems. Case-based reasoning mirrors this practical approach and did help us deal effectively with increasingly complex geometry. Our approach combines automation and interactivity. From the specification of the building 3D BIM model, our software prototype proceeds through four steps. First, the user divides the building into zones, each zone being defined by a geometrical primitive (i.e. rectangle zone, triangle zone, curved zone, etc.). Next, for each zone a similar case is retrieved from the case library. The retrieval process will generate a first incomplete 3D solution containing some inconsistencies. Next, the incomplete solution is adapted, using constraint programming techniques, to provide a consistent solution. Finally, distribution routes (i.e. ducts and pipes) are generated using constraint programming techniques. The 3D fan coil solution can be modified or improved by the designer, while providing further contribution by concentrating on interactivity. The project has been funded by the Engineering and Physical Sciences Research Council (EPSRC) in the UK
CBR and MBR techniques: review for an application in the emergencies domain
The purpose of this document is to provide an in-depth analysis of current reasoning engine practice and the integration strategies of Case Based Reasoning and Model Based Reasoning that will be used in the design and development of the RIMSAT system.
RIMSAT (Remote Intelligent Management Support and Training) is a European Commission funded project designed to:
a.. Provide an innovative, 'intelligent', knowledge based solution aimed at improving the quality of critical decisions
b.. Enhance the competencies and responsiveness of individuals and organisations involved in highly complex, safety critical incidents - irrespective of their location.
In other words, RIMSAT aims to design and implement a decision support system that using Case Base Reasoning as well as Model Base Reasoning technology is applied in the management of emergency situations.
This document is part of a deliverable for RIMSAT project, and although it has been done in close contact with the requirements of the project, it provides an overview wide enough for providing a state of the art in integration strategies between CBR and MBR technologies.Postprint (published version
On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories
Constraint answer set programming is a promising research direction that
integrates answer set programming with constraint processing. It is often
informally related to the field of satisfiability modulo theories. Yet, the
exact formal link is obscured as the terminology and concepts used in these two
research areas differ. In this paper, we connect these two research areas by
uncovering the precise formal relation between them. We believe that this work
will booster the cross-fertilization of the theoretical foundations and the
existing solving methods in both areas. As a step in this direction we provide
a translation from constraint answer set programs with integer linear
constraints to satisfiability modulo linear integer arithmetic that paves the
way to utilizing modern satisfiability modulo theories solvers for computing
answer sets of constraint answer set programs.Comment: Under consideration in Theory and Practice of Logic Programming
(TPLP
- ā¦