scholarly journals Effective grounding for hybrid planning problems represented in PDDL+

2021 ◽  
Vol 36 ◽  
Author(s):  
Enrico Scala ◽  
Mauro Vallati

Abstract Automated planning is the field of Artificial Intelligence (AI) that focuses on identifying sequences of actions allowing to reach a goal state from a given initial state. The need of using such techniques in real-world applications has brought popular languages for expressing automated planning problems to provide direct support for continuous and discrete state variables, along with changes that can be either instantaneous or durative. PDDL+ (Planning Domain Definition Language +) models support the encoding of such representations, but the resulting planning problems are notoriously difficult for AI planners to cope with due to non-linear dependencies arising from the variables and infinite search spaces. This difficulty is exacerbated by the potentially huge fully ground representations used by modern planners in order to effectively explore the search space, which can make some problems impossible to tackle. This paper investigates two grounding techniques for PDDL+ problems, both aimed at reducing the size of the full ground representation by reasoning over the lifted, more abstract problem structure. The first method extends the simple mechanism of invariant analysis to limit the groundings of operators upfront. The second method proposes to tackle the grounding process through a PDDL+ to classical planning abstraction; this allows us to leverage the amount of research done in the classical planning area. Our empirical analysis studies the effect of these novel approaches over both real-world hybrid applications and synthetic PDDL+ problems took from standard benchmarks of the planning community; our results reveal that not only the techniques improve the running time of previous grounding mechanisms but also let the planner extend the reach to problems that were not solvable before.

2020 ◽  
Vol 34 (06) ◽  
pp. 9802-9809
Author(s):  
Lukas Chrpa ◽  
Jakub Gemrot ◽  
Martin Pilat

Automated Planning addresses the problem of finding a sequence of actions, a plan, transforming the environment from its initial state to some goal state. In real-world environments, exogenous events might occur and might modify the environment without agent's consent. Besides disrupting agent's plan, events might hinder agent's pursuit towards its goals and even cause damage (e.g. destroying the robot).In this paper, we leverage the notion of Safe States in dynamic environments under presence of non-deterministic exogenous events that might eventually cause dead-ends (e.g. “damage” the agent) if the agent is not careful while executing its plan. We introduce a technique for generating plans that constrains the number of consecutive “unsafe” actions in a plan and a technique for generating “robust” plans that effectively evade event effects. Combination of both approaches plans and executes robust plans between safe states. We empirically show that such an approach effectively navigates the agent towards its goals in spite of presence of dead-ends.


Author(s):  
Debarun Bhattacharjya ◽  
Dharmashankar Subramanian ◽  
Tian Gao

Many real-world domains involve co-evolving relationships between events, such as meals and exercise, and time-varying random variables, such as a patient's blood glucose levels. In this paper, we propose a general framework for modeling joint temporal dynamics involving continuous time transitions of discrete state variables and irregular arrivals of events over the timeline. We show how conditional Markov processes (as represented by continuous time Bayesian networks) and multivariate point processes (as represented by graphical event models) are among various processes that are covered by the framework. We introduce and compare two simple and interpretable yet practical joint models within the framework with relevant baselines on simulated and real-world datasets, using a graph search algorithm for learning. The experiments highlight the importance of jointly modeling event arrivals and state variable transitions to better fit joint temporal datasets, and the framework opens up possibilities for models involving even more complex dynamics whenever suitable.


Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-19 ◽  
Author(s):  
Broderick Crawford ◽  
Ricardo Soto ◽  
Gino Astorga ◽  
José García ◽  
Carlos Castro ◽  
...  

In the real world, there are a number of optimization problems whose search space is restricted to take binary values; however, there are many continuous metaheuristics with good results in continuous search spaces. These algorithms must be adapted to solve binary problems. This paper surveys articles focused on the binarization of metaheuristics designed for continuous optimization.


Author(s):  
Jianping Lin ◽  
Wooram Park

Rapidly-exploring Random Tree (RRT) is a sampling-based algorithm which is designed for path planning problems. It is efficient to handle high-dimensional configuration space (C-space) and nonholonomic constraints. Under the nonholonomic constraints, the RRT can generate paths between an initial state and a goal state while avoiding obstacles. Since this framework assumes that a system is deterministic, more improvement should be added when the method is applied to a system with uncertainty. In robotic systems with motion uncertainty, probability for successful targeting and obstacle avoidance are more suitable measurement than the deterministic distance between the robot system and the target position. In this paper, the probabilistic targeting error is defined as a root-mean-square (RMS) distance between the system to the desired target. The proximity of the obstacle to the system is also defined as an averaged distance of obstacles to the robotic system. Then, we consider a cost function that is a sum of the targeting error and the obstacle proximity. By numerically minimizing the cost, we can obtain the optimal path. In this paper, a method for efficient evaluation and minimization of this cost function is proposed and the proposed method is applied to nonholonomic flexible medical needles for performance tests.


2015 ◽  
Vol 27 (3) ◽  
pp. 332-375 ◽  
Author(s):  
MAX KANOVICH ◽  
TAJANA BAN KIRIGIN ◽  
VIVEK NIGAM ◽  
ANDRE SCEDROV ◽  
CAROLYN TALCOTT ◽  
...  

Activities such as clinical investigations (CIs) or financial processes are subject to regulations to ensure quality of results and avoid negative consequences. Regulations may be imposed by multiple governmental agencies as well as by institutional policies and protocols. Due to the complexity of both regulations and activities, there is great potential for violation due to human error, misunderstanding, or even intent. Executable formal models of regulations, protocols and activities can form the foundation for automated assistants to aid planning, monitoring and compliance checking. We propose a model based on multiset rewriting where time is discrete and is specified by timestamps attached to facts. Actions, as well as initial, goal and critical states may be constrained by means of relative time constraints. Moreover, actions may have non-deterministic effects, i.e. they may have different outcomes whenever applied. We present a formal semantics of our model based on focused proofs of linear logic with definitions. We also determine the computational complexity of various planning problems. Plan compliance problem, for example, is the problem of finding a plan that leads from an initial state to a desired goal state without reaching any undesired critical state. We consider all actions to be balanced, i.e. their pre- and post-conditions have the same number of facts. Under this assumption on actions, we show that the plan compliance problem is PSPACE-complete when all actions have only deterministic effects and is EXPTIME-complete when actions may have non-deterministic effects. Finally, we show that the restrictions on the form of actions and time constraints taken in the specification of our model are necessary for decidability of the planning problems.


2021 ◽  
pp. 1-16
Author(s):  
Qianjin Wei ◽  
Chengxian Wang ◽  
Yimin Wen

Intelligent optimization algorithm combined with rough set theory to solve minimum attribute reduction (MAR) is time consuming due to repeated evaluations of the same position. The algorithm also finds in poor solution quality because individuals are not fully explored in space. This study proposed an algorithm based on quick extraction and multi-strategy social spider optimization (QSSOAR). First, a similarity constraint strategy was called to constrain the initial state of the population. In the iterative process, an adaptive opposition-based learning (AOBL) was used to enlarge the search space. To obtain a reduction with fewer attributes, the dynamic redundancy detection (DRD) strategy was applied to remove redundant attributes in the reduction result. Furthermore, the quick extraction strategy was introduced to avoid multiple repeated computations in this paper. By combining an array with key-value pairs, the corresponding value can be obtained by simple comparison. The proposed algorithm and four representative algorithms were compared on nine UCI datasets. The results show that the proposed algorithm performs well in reduction ability, running time, and convergence speed. Meanwhile, the results confirm the superiority of the algorithm in solving MAR.


Inventions ◽  
2021 ◽  
Vol 6 (3) ◽  
pp. 49
Author(s):  
Zain-Aldeen S. A. Rahman ◽  
Basil H. Jasim ◽  
Yasir I. A. Al-Yasir ◽  
Raed A. Abd-Alhameed ◽  
Bilal Naji Alhasnawi

In this paper, a new fractional order chaotic system without equilibrium is proposed, analytically and numerically investigated, and numerically and experimentally tested. The analytical and numerical investigations were used to describe the system’s dynamical behaviors including the system equilibria, the chaotic attractors, the bifurcation diagrams, and the Lyapunov exponents. Based on the obtained dynamical behaviors, the system can excite hidden chaotic attractors since it has no equilibrium. Then, a synchronization mechanism based on the adaptive control theory was developed between two identical new systems (master and slave). The adaptive control laws are derived based on synchronization error dynamics of the state variables for the master and slave. Consequently, the update laws of the slave parameters are obtained, where the slave parameters are assumed to be uncertain and are estimated corresponding to the master parameters by the synchronization process. Furthermore, Arduino Due boards were used to implement the proposed system in order to demonstrate its practicality in real-world applications. The simulation experimental results were obtained by MATLAB and the Arduino Due boards, respectively, with a good consistency between the simulation results and the experimental results, indicating that the new fractional order chaotic system is capable of being employed in real-world applications.


Author(s):  
Gwendolyn Rehrig ◽  
Reese A. Cullimore ◽  
John M. Henderson ◽  
Fernanda Ferreira

Abstract According to the Gricean Maxim of Quantity, speakers provide the amount of information listeners require to correctly interpret an utterance, and no more (Grice in Logic and conversation, 1975). However, speakers do tend to violate the Maxim of Quantity often, especially when the redundant information improves reference precision (Degen et al. in Psychol Rev 127(4):591–621, 2020). Redundant (non-contrastive) information may facilitate real-world search if it narrows the spatial scope under consideration, or improves target template specificity. The current study investigated whether non-contrastive modifiers that improve reference precision facilitate visual search in real-world scenes. In two visual search experiments, we compared search performance when perceptually relevant, but non-contrastive modifiers were included in the search instruction. Participants (NExp. 1 = 48, NExp. 2 = 48) searched for a unique target object following a search instruction that contained either no modifier, a location modifier (Experiment 1: on the top left, Experiment 2: on the shelf), or a color modifier (the black lamp). In Experiment 1 only, the target was located faster when the verbal instruction included either modifier, and there was an overall benefit of color modifiers in a combined analysis for scenes and conditions common to both experiments. The results suggest that violations of the Maxim of Quantity can facilitate search when the violations include task-relevant information that either augments the target template or constrains the search space, and when at least one modifier provides a highly reliable cue. Consistent with Degen et al. (2020), we conclude that listeners benefit from non-contrastive information that improves reference precision, and engage in rational reference comprehension. Significance statement This study investigated whether providing more information than someone needs to find an object in a photograph helps them to find that object more easily, even though it means they need to interpret a more complicated sentence. Before searching a scene, participants were either given information about where the object would be located in the scene, what color the object was, or were only told what object to search for. The results showed that providing additional information helped participants locate an object in an image more easily only when at least one piece of information communicated what part of the scene the object was in, which suggests that more information can be beneficial as long as that information is specific and helps the recipient achieve a goal. We conclude that people will pay attention to redundant information when it supports their task. In practice, our results suggest that instructions in other contexts (e.g., real-world navigation, using a smartphone app, prescription instructions, etc.) can benefit from the inclusion of what appears to be redundant information.


2018 ◽  
Vol 147 (1) ◽  
pp. 85-106 ◽  
Author(s):  
Ting-Chi Wu ◽  
Milija Zupanski ◽  
Lewis D. Grasso ◽  
Christian D. Kummerow ◽  
Sid-Ahmed Boukabara

Abstract Satellite all-sky radiances from the Advanced Technology Microwave Sounder (ATMS) are assimilated into the Hurricane Weather Research and Forecasting (HWRF) Model using the hybrid Gridpoint Statistical Interpolation analysis system (GSI). To extend the all-sky capability recently developed for global applications to HWRF, some modifications in HWRF and GSI are facilitated. In particular, total condensate is added as a control variable, and six distinct hydrometeor habits are added as state variables in hybrid GSI within HWRF. That is, clear-sky together with cloudy and precipitation-affected satellite pixels are assimilated using the Community Radiative Transfer Model (CRTM) as a forward operator that includes hydrometeor information and Jacobians with respect to hydrometeor variables. A single case study with the 2014 Atlantic storm Hurricane Cristobal is used to demonstrate the methodology of extending the global all-sky capability to HWRF due to ATMS data availability. Two data assimilation experiments are carried out. One experiment uses the operational configuration and assimilates ATMS radiances under the clear-sky condition, and the other experiment uses the modified HWRF system and assimilates ATMS radiances under the all-sky condition with the inclusion of total condensate update and cycling. Observed and synthetic Geostationary Operational Environmental Satellite (GOES)-13 data along with Global Precipitation Measurement Mission (GPM) Microwave Imager (GMI) data from the two experiments are used to show that the experiment with all-sky ATMS radiances assimilation has cloud signatures that are supported by observations. In contrast, there is lack of clouds in the initial state that led to a noticeable lag of cloud development in the experiment that assimilates clear-sky radiances.


Author(s):  
Victor Oduguwa ◽  
Rajkumar Roy ◽  
Didier Farrugia

Most of the algorithmic engineering design optimisation approaches reported in the literature aims to find the best set of solutions within a quantitative (QT) search space of the given problem while ignoring related qualitative (QL) issues. These QL issues can be very important and by ignoring them in the optimisation search, can have expensive consequences especially for real world problems. This paper presents a new integrated design optimisation approach for QT and QL search space. The proposed solution approach is based on design of experiment methods and fuzzy logic principles for building the required QL models, and evolutionary multi-objective optimisation technique for solving the design problem. The proposed technique was applied to a two objectives rod rolling problem. The results obtained demonstrate that the proposed solution approach can be used to solve real world problems taking into account the related QL evaluation of the design problem.


Sign in / Sign up

Export Citation Format

Share Document