Download or read book Improved Heuristic Search Algorithms for Decision theoretic Planning written by Ibrahim Abdoulahi and published by . This book was released on 2017 with total page 106 pages. Available in PDF, EPUB and Kindle. Book excerpt: A large class of practical planning problems that require reasoning about uncertain outcomes, as well as tradeoffs among competing goals, can be modeled as Markov decision processes (MDPs). This model has been studied for over 60 years, and has many applications that range from stochastic inventory control and supply-chain planning, to probabilistic model checking and robotic control. Standard dynamic programming algorithms solve these problems for the entire state space. A more efficient heuristic search approach focuses computation on solving these problems for the relevant part of the state space only, given a start state, and using heuristics to identify irrelevant parts of the state space that can be safely ignored. This dissertation considers the heuristic search approach to this class of problems, and makes three contributions that advance this approach. The first contribution is a novel algorithm for solving MDPs that integrates the standard value iteration algorithm with branch-and-bound search. Called branch-and-bound value iteration, the new algorithm has several advantages over existing algorithms. The second contribution is the integration of recently-developed suboptimality bounds in heuristic search algorithm for MDPs, making it possible for iterative algorithms for solving these planning problems to detect convergence to a bounded-suboptimal solution. The third contribution is the evaluation and analysis of some techniques that are widely-used by state-of-the-art planning algorithms, the identification of some weaknesses of these techniques, and the development of a more efficient implementation of one of these techniques – a solved-labeling procedure that speeds converge by leveraging a decomposition of the state-space graph of a planning problem into strongly-connected components. The new algorithms and techniques introduced in this dissertation are experimentally evaluated on a range of widely-used planning benchmarks.
Download or read book Heuristic Search written by Stefan Edelkamp and published by Elsevier. This book was released on 2011-05-31 with total page 865 pages. Available in PDF, EPUB and Kindle. Book excerpt: Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed. Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises help to create a full and realized picture of how search fits into the world of artificial intelligence and the one around us. Provides real-world success stories and case studies for heuristic search algorithms Includes many AI developments not yet covered in textbooks such as pattern databases, symbolic search, and parallel processing units
Download or read book Probabilistic Search for Tracking Targets written by Irad Ben-Gal and published by John Wiley & Sons. This book was released on 2013-03-25 with total page 367 pages. Available in PDF, EPUB and Kindle. Book excerpt: Presents a probabilistic and information-theoretic framework for a search for static or moving targets in discrete time and space. Probabilistic Search for Tracking Targets uses an information-theoretic scheme to present a unified approach for known search methods to allow the development of new algorithms of search. The book addresses search methods under different constraints and assumptions, such as search uncertainty under incomplete information, probabilistic search scheme, observation errors, group testing, search games, distribution of search efforts, single and multiple targets and search agents, as well as online or offline search schemes. The proposed approach is associated with path planning techniques, optimal search algorithms, Markov decision models, decision trees, stochastic local search, artificial intelligence and heuristic information-seeking methods. Furthermore, this book presents novel methods of search for static and moving targets along with practical algorithms of partitioning and search and screening. Probabilistic Search for Tracking Targets includes complete material for undergraduate and graduate courses in modern applications of probabilistic search, decision-making and group testing, and provides several directions for further research in the search theory. The authors: Provide a generalized information-theoretic approach to the problem of real-time search for both static and moving targets over a discrete space. Present a theoretical framework, which covers known information-theoretic algorithms of search, and forms a basis for development and analysis of different algorithms of search over probabilistic space. Use numerous examples of group testing, search and path planning algorithms to illustrate direct implementation in the form of running routines. Consider a relation of the suggested approach with known search theories and methods such as search and screening theory, search games, Markov decision process models of search, data mining methods, coding theory and decision trees. Discuss relevant search applications, such as quality-control search for nonconforming units in a batch or a military search for a hidden target. Provide an accompanying website featuring the algorithms discussed throughout the book, along with practical implementations procedures.
Download or read book Planning Algorithms written by Steven M. LaValle and published by Cambridge University Press. This book was released on 2006-05-29 with total page 844 pages. Available in PDF, EPUB and Kindle. Book excerpt: Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this is the only book on this topic that tightly integrates a vast body of literature from several fields into a coherent source for teaching and reference in a wide variety of applications. Difficult mathematical material is explained through hundreds of examples and illustrations.
Download or read book Search in Artificial Intelligence written by Leveen Kanal and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 491 pages. Available in PDF, EPUB and Kindle. Book excerpt: Search is an important component of problem solving in artificial intelligence (AI) and, more generally, in computer science, engineering and operations research. Combinatorial optimization, decision analysis, game playing, learning, planning, pattern recognition, robotics and theorem proving are some of the areas in which search algbrithms playa key role. Less than a decade ago the conventional wisdom in artificial intelligence was that the best search algorithms had already been invented and the likelihood of finding new results in this area was very small. Since then many new insights and results have been obtained. For example, new algorithms for state space, AND/OR graph, and game tree search were discovered. Articles on new theoretical developments and experimental results on backtracking, heuristic search and constraint propaga tion were published. The relationships among various search and combinatorial algorithms in AI, Operations Research, and other fields were clarified. This volume brings together some of this recent work in a manner designed to be accessible to students and professionals interested in these new insights and developments.
Download or read book Planning with Markov Decision Processes written by Mausam Natarajan and published by Springer Nature. This book was released on 2022-06-01 with total page 204 pages. Available in PDF, EPUB and Kindle. Book excerpt: Markov Decision Processes (MDPs) are widely popular in Artificial Intelligence for modeling sequential decision-making scenarios with probabilistic dynamics. They are the framework of choice when designing an intelligent agent that needs to act for long periods of time in an environment where its actions could have uncertain outcomes. MDPs are actively researched in two related subareas of AI, probabilistic planning and reinforcement learning. Probabilistic planning assumes known models for the agent's goals and domain dynamics, and focuses on determining how the agent should behave to achieve its objectives. On the other hand, reinforcement learning additionally learns these models based on the feedback the agent gets from the environment. This book provides a concise introduction to the use of MDPs for solving probabilistic planning problems, with an emphasis on the algorithmic perspective. It covers the whole spectrum of the field, from the basics to state-of-the-art optimal and approximation algorithms. We first describe the theoretical foundations of MDPs and the fundamental solution techniques for them. We then discuss modern optimal algorithms based on heuristic search and the use of structured representations. A major focus of the book is on the numerous approximation schemes for MDPs that have been developed in the AI literature. These include determinization-based approaches, sampling techniques, heuristic functions, dimensionality reduction, and hierarchical representations. Finally, we briefly introduce several extensions of the standard MDP classes that model and solve even more complex planning problems. Table of Contents: Introduction / MDPs / Fundamental Algorithms / Heuristic Search Algorithms / Symbolic Algorithms / Approximation Algorithms / Advanced Notes
Download or read book Abstraction Reformulation and Approximation written by Sven Koenig and published by Springer. This book was released on 2003-08-02 with total page 360 pages. Available in PDF, EPUB and Kindle. Book excerpt: It has been recognized since the inception of Artificial Intelligence (AI) that abstractions, problem reformulations, and approximations (AR&A) are central to human common sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains. AR&A techniques have been used to solve a variety of tasks, including automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving. The primary purpose of AR&A techniques in such settings is to overcome computational intractability. In addition, AR&A techniques are useful for accelerating learning and for summarizing sets of solutions. This volume contains the proceedings of SARA 2002, the fifth Symposium on Abstraction, Reformulation, and Approximation, held at Kananaskis Mountain Lodge, Kananaskis Village, Alberta (Canada), August 2 4, 2002. The SARA series is the continuation of two separate threads of workshops: AAAI workshops in 1990 and 1992, and an ad hoc series beginning with the "Knowledge Compilation" workshop in 1986 and the "Change of Representation and Inductive Bias" workshop in 1988 with followup workshops in 1990 and 1992. The two workshop series merged in 1994 to form the first SARA. Subsequent SARAs were held in 1995, 1998, and 2000.
Download or read book Metaheuristic Optimization via Memory and Evolution written by Cesar Rego and published by Springer Science & Business Media. This book was released on 2006-03-30 with total page 472 pages. Available in PDF, EPUB and Kindle. Book excerpt: Tabu Search (TS) and, more recently, Scatter Search (SS) have proved highly effective in solving a wide range of optimization problems, and have had a variety of applications in industry, science, and government. The goal of Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search is to report original research on algorithms and applications of tabu search, scatter search or both, as well as variations and extensions having "adaptive memory programming" as a primary focus. Individual chapters identify useful new implementations or new ways to integrate and apply the principles of TS and SS, or that prove new theoretical results, or describe the successful application of these methods to real world problems.
Download or read book Rational Search written by Andrew Eric Mayer and published by . This book was released on 1994 with total page 224 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms for Decision Making written by Mykel J. Kochenderfer and published by MIT Press. This book was released on 2022-08-16 with total page 701 pages. Available in PDF, EPUB and Kindle. Book excerpt: A broad introduction to algorithms for decision making under uncertainty, introducing the underlying mathematical problem formulations and the algorithms for solving them. Automated decision-making systems or decision-support systems—used in applications that range from aircraft collision avoidance to breast cancer screening—must be designed to account for various sources of uncertainty while carefully balancing multiple objectives. This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them. The book first addresses the problem of reasoning about uncertainty and objectives in simple decisions at a single point in time, and then turns to sequential decision problems in stochastic environments where the outcomes of our actions are uncertain. It goes on to address model uncertainty, when we do not start with a known model and must learn how to act through interaction with the environment; state uncertainty, in which we do not know the current state of the environment due to imperfect perceptual information; and decision contexts involving multiple agents. The book focuses primarily on planning and reinforcement learning, although some of the techniques presented draw on elements of supervised learning and optimization. Algorithms are implemented in the Julia programming language. Figures, examples, and exercises convey the intuition behind the various approaches presented.
Download or read book ECAI 2016 written by G.A. Kaminka and published by IOS Press. This book was released on 2016-08-24 with total page 1860 pages. Available in PDF, EPUB and Kindle. Book excerpt: Artificial Intelligence continues to be one of the most exciting and fast-developing fields of computer science. This book presents the 177 long papers and 123 short papers accepted for ECAI 2016, the latest edition of the biennial European Conference on Artificial Intelligence, Europe’s premier venue for presenting scientific results in AI. The conference was held in The Hague, the Netherlands, from August 29 to September 2, 2016. ECAI 2016 also incorporated the conference on Prestigious Applications of Intelligent Systems (PAIS) 2016, and the Starting AI Researcher Symposium (STAIRS). The papers from PAIS are included in this volume; the papers from STAIRS are published in a separate volume in the Frontiers in Artificial Intelligence and Applications (FAIA) series. Organized by the European Association for Artificial Intelligence (EurAI) and the Benelux Association for Artificial Intelligence (BNVKI), the ECAI conference provides an opportunity for researchers to present and hear about the very best research in contemporary AI. This proceedings will be of interest to all those seeking an overview of the very latest innovations and developments in this field.
Download or read book Modern Heuristic Search Methods written by V. J. Rayward-Smith and published by John Wiley & Sons. This book was released on 1996-12-23 with total page 320 pages. Available in PDF, EPUB and Kindle. Book excerpt: Including contributions from leading experts in the field, this book covers applications and developments of heuristic search methods for solving complex optimization problems. The book covers various local search strategies including genetic algorithms, simulated annealing, tabu search and hybrids thereof. These methods have proved extraordinarily successful by solving some of the most difficult, real-world problems. At the interface between Artificial Intelligence and Operational Research, research in this exciting area is progressing apace spurred on by the needs of industry and commerce. The introductory chapter provides a clear overview of the basic techniques and useful pointers to further reading and to current research. The second section of the book covers some of the most recent and exciting developments of the basic techniques, with suggestions not only for extending and improving these but also for hybridizing and incorporating automatic adaption. The third section contains a number of case studies, surveys and comparative studies which span a wide range of application areas ranging from the classic Steiner tree problem to more practical problems arising in telecommunications and data analysis. The coverage of the latest research and the illustrative case studies will ensure that the book is invaluable for researchers and professionals with an interest in heuristic search methods.
Download or read book Planning in Intelligent Systems written by Wout van Wezel and published by John Wiley & Sons. This book was released on 2006-03-03 with total page 592 pages. Available in PDF, EPUB and Kindle. Book excerpt: The first comparative examination of planning paradigms This text begins with the principle that the ability to anticipateand plan is an essential feature of intelligent systems, whetherhuman or machine. It further assumes that better planning resultsin greater achievements. With these principles as a foundation,Planning in Intelligent Systems provides readers with the toolsneeded to better understand the process of planning and to becomebetter planners themselves. The text is divided into two parts: * Part One, "Theoretical," discusses the predominant schools ofthought in planning: psychology and cognitive science,organizational science, computer science, mathematics, artificialintelligence, and systems theory. In particular, the book examinescommonalities and differences among the goals, methods, andtechniques of these various approaches to planning. The result is abetter understanding of the process of planning through thecross-fertilization of ideas. Each chapter contains a shortintroduction that sets forth the interrelationships of that chapterto the main ideas featured in the other chapters. * Part Two, "Practical," features six chapters that center on acase study of The Netherlands Railways. Readers learn to applytheory to a real-world situation and discoverhow expanding theirrepertoire of planning methods can help solve seemingly intractableproblems. All chapters have been contributed by leading experts in thevarious schools of planning and carefully edited to ensure aconsistent high standard throughout. This book is designed to not only expand the range of planningtools used, but also to enable readers to use them moreeffectively. It challenges readers to look at new approaches andlearn from new schools of thought. Planning in Intelligent Systemsdelivers effective planning approaches for researchers, professors,students, and practitioners in artificial intelligence, computerscience, cognitive psychology, and mathematics, as well as industryplanners and managers.
Download or read book Intelligent Techniques for Planning written by Ioannis Vlahavas and published by IGI Global. This book was released on 2005-01-01 with total page 384 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Intelligent Techniques for Planning presents a number of modern approaches to the area of automated planning. These approaches combine methods from classical planning such as the construction of graphs and the use of domain-independent heuristics with techniques from other areas of artificial intelligence. This book discuses, in detail, a number of state-of-the-art planning systems that utilize constraint satisfaction techniques in order to deal with time and resources, machine learning in order to utilize experience drawn from past runs, methods from knowledge systems for more expressive representation of knowledge and ideas from other areas such as Intelligent Agents. 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 on similar approaches done in the past.
Download or read book Planning Based on Decision Theory written by Giacomo Della Riccia and published by Springer. This book was released on 2014-05-04 with total page 170 pages. Available in PDF, EPUB and Kindle. Book excerpt: Planning of actions based on decision theory is a hot topic for many disciplines. Seemingly unlimited computing power, networking, integration and collaboration have meanwhile attracted the attention of fields like Machine Learning, Operations Research, Management Science and Computer Science. Software agents of e-commerce, mediators of Information Retrieval Systems and Database based Information Systems are typical new application areas. Until now, planning methods were successfully applied in production, logistics, marketing, finance, management, and used in robots, software agents etc. It is the special feature of the book that planning is embedded into decision theory, and this will give the interested reader new perspectives to follow-up.
Download or read book Research and Development in Intelligent Systems XXIV written by Max Bramer and published by Springer Science & Business Media. This book was released on 2007-12-03 with total page 394 pages. Available in PDF, EPUB and Kindle. Book excerpt: An agent in a multi-agent system (MAS) has to generate plans for its individual goal, but these plans may con?ict with those that are already being scheduled or executed by other agents. It must also be able to complete its planning and resolution of these con?icts within a reasonable time to have an acceptable quality plan. Although we adopt hierarchical planning (HP, for example, see [7, 12]) using the decision-theoretic planning (DTP) approach [6] for ef?cient planning, it is not trivial to apply HPO to MAS. In HP, appropriate (abstract) plans are selected level by level to maximize the utility U (p), where where p is the expected ?nal plan comprising a sequence of primitive actions. However, in the MAS context, con?icts between agents affect the ef?ciency and quality of resulting plans. When a con?ict is found at lower levels, an additional sophisticated process for avoiding it (con?ict resolution) must be invoked and some extra actions (such as waiting for synchronization and detouring) may have to be added to the plan. The con?ict resolution process may become costly or fail. Even a single con?ict, if it is dif?cult to resolve, will result in a plan with considerably lower quality than it otherwise would have. As a result, in multi-agent systems, the second- or third-best plans may result in better overall performance.
Download or read book Advances in Mechanical Design written by Jianrong Tan and published by Springer Nature. This book was released on with total page 2698 pages. Available in PDF, EPUB and Kindle. Book excerpt:
