scholarly journals Learning First-Order Representations for Planning from Black Box States: New Results

2021 ◽  
Author(s):  
Ivan D. Rodriguez ◽  
Blai Bonet ◽  
Javier Romero ◽  
Hector Geffner

Recently Bonet and Geffner have shown that first-order representations for planning domains can be learned from the structure of the state space without any prior knowledge about the action schemas or domain predicates. For this, the learning problem is formulated as the search for a simplest first-order domain description D that along with information about instances I_i (number of objects and initial state) determine state space graphs G(P_i) that match the observed state graphs G_i where P_i = (D, I_i). The search is cast and solved approximately by means of a SAT solver that is called over a large family of propositional theories that differ just in the parameters encoding the possible number of action schemas and domain predicates, their arities, and the number of objects. In this work, we push the limits of these learners by moving to an answer set programming (ASP) encoding using the CLINGO system. The new encodings are more transparent and concise, extending the range of possible models while facilitating their exploration. We show that the domains introduced by Bonet and Geffner can be solved more efficiently in the new approach, often optimally, and furthermore, that the approach can be easily extended to handle partial information about the state graphs as well as noise that prevents some states from being distinguished.

Author(s):  
Harvei Desmon Hutahaean

Search is the process of finding solutions in a problem until a solution or goal is found, or a movement in the state-space to search for trajectories from initial-state to goal-state. In a TIC TAC Toe game the process of finding a space situation is not enough to automate problem-solving behavior, in each of these situations there are only a limited number of choices that a player can make. The problems that will be faced can be solved by searching from the choices available, supported by the usual way of resolving. Best First Search works by searching for a directed graph which each node represents a point in a problem space.


2011 ◽  
Vol 21 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Vladan Batanovic ◽  
Slobodan Guberinic ◽  
Radivoj Petrovic

This paper shows that the concepts and methodology contained in the system theory and operations research are suitable for application in the planning and control of the sustainable development. The sustainable development problems can be represented using the state space concepts, such as the transition of system, from the given initial state to the final state. It is shown that sustainable development represents a specific control problem. The peculiarity of the sustainable development is that the target is to keep the system in the prescribed feasible region of the state space. The analysis of planning and control problems of sustainable development has also shown that methods developed in the operations research area, such as multicriteria optimization, dynamic processes simulation, non-conventional treatment of uncertainty etc. are adequate, exact base, suitable for resolution of these problems.


Author(s):  
Andrzej Zawadzki

Purpose – The purpose of this paper is to aim to an application of element of the theory of differential geometry for building the state space transformation, linearizing nonlinear dynamic system into a linear form. Design/methodology/approach – It is assumed that the description of nonlinear electric circuits with concentrated parameters or electromechanical systems is given by nonlinear system of differential equations of first order (state equations). The goal is to find transformation which leads nonlinear state equation (written in one coordinate system) to the linear in the other – sought coordinate system. Findings – The necessary conditions fulfilled by nonlinear system undergoing linearization process are presented. Numerical solutions of the nonlinear equations of state together with linearized system obtained from direct transformation of the state space are included (transformation input – the state of the nonlinear system). Originality/value – Application of first order exact differential forms for determining the transformation linearizing the nonlinear state equation. Simple linear models obtained with the use of the linearizing transformation are very useful (mainly because of the known and well-mastered theory of linear systems) in solving of various practical technical problems.


2017 ◽  
Vol Volume 27 - 2017 - Special... ◽  
Author(s):  
Médésu Sogbohossou ◽  
Antoine Vianou

The partial-order technique of the unfolding implicitly represents state-space of a Petri net (PN), by in particular preserving the concurrency relations between the events. That makes it possible to contain state-space explosion problem in case of strong concurrency. A complete prefix of unfolding is used to cover all the state-space of a bounded PN: its computation according to the classical approach is based on the concept of adequate order, taking directly into account only safe PN. In this paper, a new approach independent of the concept of adequate order and faithful to the partial-order semantics, consists in creating the events of the unfolding in the context of a single process at the same time. The results of the tests are conclusive for safe and nonsafe PN. Some solutions are presented to improve compactness of the prefix obtained. La technique d'ordre partiel du dépliage représente implicitement l'espace d'état d'un réseau de Petri (RdP), en conservant notamment les relations de concurrence entre les événements. Cela permet de contenir le phénomène de l'explosion combinatoire en cas de forte concurrence. Un préfixe complet de dépliage sert à couvrir tout l'espace d'état d'un RdP borné: son calcul suivant l'approche classique se base sur le concept d'ordre adéquat, ne prenant directement en compte que les RdP saufs. Dans cet article, une nouvelle approche indépendante du concept d'ordre adéquat et fidèle à la sémantique d'ordre partiel, consiste à créer les événements du dépliage dans le contexte d'un unique processus à la fois. Les résultats des tests sont concluants pour les RdP saufs et non saufs. Des solutions sont présentées pour améliorer la compacité du préfixe obtenu.


2014 ◽  
Vol 926-930 ◽  
pp. 3245-3249
Author(s):  
Xiao Ping Wan ◽  
Shu Yu Li

DEC-POMDP(Distributed Partially Observable Markov Decision Process) model is a multi-agent model of collaborative decision-making is important, but due to an alarming number of DEC-POMDP problem state space and great strategy solution space, so DEC-POMDP solution of the problem becomes very difficult. The agent from the initial state to the target state during the interaction with the environment, the system's maximum benefit is often only with some small amount of a higher reward states. This article by searching from the initial belief state to the target state to get a shortest Hamiltonian path, according to the corresponding sequence of actions on the path forward search to get faith belief state space trajectory, and then along the trajectory reverse convictions value function iteration, thus forming the state with the largest gains beliefs trajectory corresponding optimal strategy. In this paper, shortest Hamiltonian path-based value iteration to search the optimal path of faith so as to solve the state Hamiltonian larger DEC-POMDP problem.


Author(s):  
Matthias Thimm ◽  
Federico Cerutti ◽  
Mauro Vallati

We address the problem of deciding skeptical acceptance wrt. preferred semantics of an argument in abstract argumentation frameworks, i.e., the problem of deciding whether an argument is contained in all maximally admissible sets, a.k.a. preferred extensions. State-of-the-art algorithms solve this problem with iterative calls to an external SAT-solver to determine preferred extensions. We provide a new characterisation of skeptical acceptance wrt. preferred semantics that does not involve the notion of a preferred extension. We then develop a new algorithm that also relies on iterative calls to an external SAT-solver but avoids the costly part of maximising admissible sets. We present the results of an experimental evaluation that shows that this new approach significantly outperforms the state of the art. We also apply similar ideas to develop a new algorithm for computing the ideal extension.


Author(s):  
Corey Brettschneider

How should a liberal democracy respond to hate groups and others that oppose the ideal of free and equal citizenship? The democratic state faces the hard choice of either protecting the rights of hate groups and allowing their views to spread, or banning their views and violating citizens' rights to freedoms of expression, association, and religion. Avoiding the familiar yet problematic responses to these issues, this book proposes a new approach called value democracy. The theory of value democracy argues that the state should protect the right to express illiberal beliefs, but the state should also engage in democratic persuasion when it speaks through its various expressive capacities: publicly criticizing, and giving reasons to reject, hate-based or other discriminatory viewpoints. Distinguishing between two kinds of state action—expressive and coercive—the book contends that public criticism of viewpoints advocating discrimination based on race, gender, or sexual orientation should be pursued through the state's expressive capacities as speaker, educator, and spender. When the state uses its expressive capacities to promote the values of free and equal citizenship, it engages in democratic persuasion. By using democratic persuasion, the state can both respect rights and counter hateful or discriminatory viewpoints. The book extends this analysis from freedom of expression to the freedoms of religion and association, and shows that value democracy can uphold the protection of these freedoms while promoting equality for all citizens.


Sign in / Sign up

Export Citation Format

Share Document