One of the most important functions of artificial intelligence, automated problem solving, consists mainly of the development of software systems designed to find solutions to problems. These systems utilize a search space and algorithms in order to reach a solution.
Artificial Intelligence for Advanced Problem Solving Techniques offers scholars and practitioners cutting-edge research on algorithms and techniques such as search, domain independent heuristics, scheduling, constraint satisfaction, optimization, configuration, and planning, and highlights the relationship between the search categories and the various ways a specific application can be modeled and solved using advanced problem solving techniques.
Reviews and Testimonials
This book aims to provide the user with knowledge about the principles of Artificial Intelligence and about innovative methodologies that utilize the effort spent by researchers in various different fields in order to build effective problem-solving systems.
– Dimitris Vrakas, Aristotle University, Greece
This collection offers scholars and practitioners cutting-edge research on algorithms and techniques such as search, domain independent heuristics, scheduling, constraint satisfaction, optimization, configuration, and planning.
– APADE (2008)
This book has been written to teach IT researchers, system engineers and students about the latest research on automated problem solving.
– Book News Inc. (June 2008)
The book is suitable for postgraduates, researchers and practitioners in planning, scheduling, optimization, machine learning, and advanced problem solving. The book is a valuable addition to any science library.
– H. Yousef, INVISTA Performance Technologies, Journal of the Operational Research Society (2010)
Problem Solving is a complex mental activity that occurs when an agent (biological, robotic or software) does not know how to proceed from a given state to a desired goal state. The nature of human problem solving has been studied by psychologists over the past hundred years and it has also been a subject of research in Artificial Intelligence from the early ‘60s with the General Problem Solver (GPS). Artificial Intelligence is concerned with two major topics in Problem Solving: representation of the problem and automatically extracting a solution to it. Automated Problem Solving is the area of Artificial Intelligence that is mainly concerned with the development of software systems that given a formal representation of a problem they find a solution to it.
These systems usually explore a search space, utilizing search algorithms in order to reach one or more goal states. These search problems are divided in five main categories: a) Automated Planning, b) Constraint Satisfaction and Scheduling, c) Machine Learning, d) Optimization, e) Genetic Algorithms and Genetic Programming.
The fist category, namely Planning, refers to problems where the solution is a sequence of actions that if applied to the initial state will eventually lead to a new state that satisfies the goals. Examples of this category includes robot control problems, navigation problems (e.g. path planning), logistics etc.
The second category is Constraint Satisfaction and Scheduling and is concerned with problems where the goal is to assign values to a set of variables in a way that a set of constraints is met, while optimizing a certain cost function. There are numerous examples of problems of this category like workers’ shifts, timetabling, resource allocation etc.
Machine Learning, which is the third category, is concerned with problems in which an artificial agent must learn. The major focus of Machine learning is to extract information from data automatically by computational and statistical methods. The applications of Machine Learning mainly concern data analysis tasks in decision support systems Data Mining is the application of Machine Learning in large data bases.
The fourth category is optimization problems, where there is a function that measures the appropriateness of each state and the goal of the problem is to find a state that either maximizes or minimizes this function. In contrast to the other categories, no information concerning the goals state is included in the problem representation. A representative example of this category is the Travelling Salesman Person (TSP) problem.
The last category includes genetic algorithms and genetic programming. Genetic algorithms are a particular class of evolutionary algorithms that use techniques inspired by evolutionary biology such as inheritance, mutation, selection, and crossover in order to solve optimization and search problems. Genetic programming is an area of genetic algorithms which is concerned with the automatic creation of computer programs that perform a specific user-defined task.
This edited volume, entitled Artificial Intelligence for Advanced Problem Solving Techniques, consists of 13 chapters, bringing together a number of modern approaches on the area of Automated or Advanced Problem Solving. The book presents in detail a number of state-of-the-art algorithms and systems mainly for solving search problems. Apart from the thorough analysis and implementation details, each chapter of the book also provides extensive background information about its subject and presents and comments similar approaches done in the past.