Knowledge revision in systems based on an informed tree search strategy : application to cartographic generalisation

04/23/2012
by   Patrick Taillandier, et al.
0

Many real world problems can be expressed as optimisation problems. Solving this kind of problems means to find, among all possible solutions, the one that maximises an evaluation function. One approach to solve this kind of problem is to use an informed search strategy. The principle of this kind of strategy is to use problem-specific knowledge beyond the definition of the problem itself to find solutions more efficiently than with an uninformed strategy. This kind of strategy demands to define problem-specific knowledge (heuristics). The efficiency and the effectiveness of systems based on it directly depend on the used knowledge quality. Unfortunately, acquiring and maintaining such knowledge can be fastidious. The objective of the work presented in this paper is to propose an automatic knowledge revision approach for systems based on an informed tree search strategy. Our approach consists in analysing the system execution logs and revising knowledge based on these logs by modelling the revision problem as a knowledge space exploration problem. We present an experiment we carried out in an application domain where informed search strategies are often used: cartographic generalisation.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/23/2012

Using Belief Theory to Diagnose Control Knowledge Quality. Application to cartographic generalisation

Both humans and artificial systems frequently use trial and error method...
12/13/2018

Minuet: A method to solve Sudoku puzzles by hand

This paper presents a systematic method to solve difficult 9 x 9 Sudoku ...
02/16/2020

Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics

Informed sampling-based planning algorithms exploit problem knowledge fo...
04/10/2020

Time-Informed Exploration For Robot Motion Planning

Anytime sampling-based methods are an attractive technique for solving k...
03/21/2011

Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains

The state of the art in local search for the Traveling Salesman Problem ...
09/28/2017

Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem

One of the key challenges for operations researchers solving real-world ...
09/07/2020

Supporting the Problem-Solving Loop: Designing Highly Interactive Optimisation Systems

Efficient optimisation algorithms have become important tools for findin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.