Computational Complexity of some Optimization Problems in Planning PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Computational Complexity of some Optimization Problems in Planning PDF full book. Access full book title Computational Complexity of some Optimization Problems in Planning by Meysam Aghighi. Download full books in PDF and EPUB format.
Author: Meysam Aghighi Publisher: Linköping University Electronic Press ISBN: 9176855198 Category : Languages : en Pages : 35
Book Description
Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. We use this methodology for studying the computational complexity of planning. Finding new tractable (i.e. polynomial-time solvable) problems has been a particularly important goal for researchers in the area. The reason behind this is not only to differentiate between easy and hard planning instances, but also to use polynomial-time solvable instances in order to construct better heuristic functions and improve planners. We identify a new class of tractable cost-optimal planning instances by restricting the causal graph. We study the computational complexity of oversubscription planning (such as the net-benefit problem) under various restrictions and reveal strong connections with classical planning. Inspired by this, we present a method for compiling oversubscription planning problems into the ordinary plan existence problem. We further study the parameterized complexity of cost-optimal and net-benefit planning under the same restrictions and show that the choice of numeric domain for the action costs has a great impact on the parameterized complexity. We finally consider the parameterized complexity of certain problems related to partial-order planning. In some applications, less restricted plans than total-order plans are needed. Therefore, a partial-order plan is being used instead. When dealing with partial-order plans, one important question is how to achieve optimal partial order plans, i.e. having the highest degree of freedom according to some notion of flexibility. We study several optimization problems for partial-order plans, such as finding a minimum deordering or reordering, and finding the minimum parallel execution length.
Author: Meysam Aghighi Publisher: Linköping University Electronic Press ISBN: 9176855198 Category : Languages : en Pages : 35
Book Description
Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. We use this methodology for studying the computational complexity of planning. Finding new tractable (i.e. polynomial-time solvable) problems has been a particularly important goal for researchers in the area. The reason behind this is not only to differentiate between easy and hard planning instances, but also to use polynomial-time solvable instances in order to construct better heuristic functions and improve planners. We identify a new class of tractable cost-optimal planning instances by restricting the causal graph. We study the computational complexity of oversubscription planning (such as the net-benefit problem) under various restrictions and reveal strong connections with classical planning. Inspired by this, we present a method for compiling oversubscription planning problems into the ordinary plan existence problem. We further study the parameterized complexity of cost-optimal and net-benefit planning under the same restrictions and show that the choice of numeric domain for the action costs has a great impact on the parameterized complexity. We finally consider the parameterized complexity of certain problems related to partial-order planning. In some applications, less restricted plans than total-order plans are needed. Therefore, a partial-order plan is being used instead. When dealing with partial-order plans, one important question is how to achieve optimal partial order plans, i.e. having the highest degree of freedom according to some notion of flexibility. We study several optimization problems for partial-order plans, such as finding a minimum deordering or reordering, and finding the minimum parallel execution length.
Author: Francis Spufford Publisher: Graywolf Press ISBN: 1555970419 Category : History Languages : en Pages : 437
Book Description
"Spufford cunningly maps out a literary genre of his own . . . Freewheeling and fabulous." —The Times (London) Strange as it may seem, the gray, oppressive USSR was founded on a fairy tale. It was built on the twentieth-century magic called "the planned economy," which was going to gush forth an abundance of good things that the lands of capitalism could never match. And just for a little while, in the heady years of the late 1950s, the magic seemed to be working. Red Plenty is about that moment in history, and how it came, and how it went away; about the brief era when, under the rash leadership of Khrushchev, the Soviet Union looked forward to a future of rich communists and envious capitalists, when Moscow would out-glitter Manhattan and every Lada would be better engineered than a Porsche. It's about the scientists who did their genuinely brilliant best to make the dream come true, to give the tyranny its happy ending. Red Plenty is history, it's fiction, it's as ambitious as Sputnik, as uncompromising as an Aeroflot flight attendant, and as different from what you were expecting as a glass of Soviet champagne.
Author: Panos M. Pardalos Publisher: Springer Science & Business Media ISBN: 1475731450 Category : Technology & Engineering Languages : en Pages : 597
Book Description
There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.
Author: Sanjeev Arora Publisher: Cambridge University Press ISBN: 0521424267 Category : Computers Languages : en Pages : 609
Book Description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Author: Michael Jünger Publisher: Springer Science & Business Media ISBN: 3540428771 Category : Mathematics Languages : en Pages : 317
Book Description
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Author: Publisher: IOS Press ISBN: Category : Languages : en Pages : 7289
Author: Vangelis Th. Paschos Publisher: John Wiley & Sons ISBN: 1119015243 Category : Mathematics Languages : en Pages : 450
Book Description
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Author: Stefka Fidanova Publisher: Springer Nature ISBN: 3030823970 Category : Technology & Engineering Languages : en Pages : 487
Book Description
This book presents recent advances in computational optimization. Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. The book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2020. The book includes important real problems like modeling of physical processes, workforce planning, parameter settings for controlling different processes, transportation problems, wireless sensor networks, machine scheduling, air pollution modeling, solving multiple integrals and systems of differential equations which describe real processes, solving engineering problems. It shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics and other domains can be formulated as optimization problems.
Author: Ding-Zhu Du Publisher: Springer Science & Business Media ISBN: 1475730233 Category : Mathematics Languages : en Pages : 650
Book Description
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).
Author: Meysam Aghighi
Author: Meysam Aghighi
Author: Francis Spufford
Author: Panos M. Pardalos
Author: Sanjeev Arora
Author: Michael Jünger
Author: 
Author: Vangelis Th. Paschos
Author: Stefka Fidanova
Author: J. K. Lenstra
Author: Ding-Zhu Du