45 research outputs found
Recommended from our members
Reliable Decision-Making with Imprecise Models
The rapid growth in the deployment of autonomous systems across various sectors has generated considerable interest in how these systems can operate reliably in large, stochastic, and unstructured environments. Despite recent advances in artificial intelligence and machine learning, it is challenging to assure that autonomous systems will operate reliably in the open world. One of the causes of unreliable behavior is the impreciseness of the model used for decision-making. Due to the practical challenges in data collection and precise model specification, autonomous systems often operate based on models that do not represent all the details in the environment. Even if the system has access to a comprehensive decision-making model that accounts for all the details in the environment and all possible scenarios the agent may encounter, it may be intractable to solve this complex model optimally. Consequently, this complex, high fidelity model may be simplified to accelerate planning, introducing imprecision. Reasoning with such imprecise models affects the reliability of autonomous systems. A system\u27s actions may sometimes produce unexpected, undesirable consequences, which are often identified after deployment. How can we design autonomous systems that can operate reliably in the presence of uncertainty and model imprecision?
This dissertation presents solutions to address three classes of model imprecision in a Markov decision process, along with an analysis of the conditions under which bounded-performance can be guaranteed. First, an adaptive outcome selection approach is introduced to devise risk-aware reduced models of the environment that efficiently balance the trade-off between model simplicity and fidelity, to accelerate planning in resource-constrained settings. Second, a framework that extends stochastic shortest path framework to problems with imperfect information about the goal state during planning is introduced, along with two solution approaches to solve this problem. Finally, two complementary solution approaches are presented to minimize the negative side effects of agent actions. The techniques presented in this dissertation enable an autonomous system to detect and mitigate undesirable behavior, without redesigning the model entirely
REQUEST AWARE STRENGTH OF CHARACTER OF INDEFINITE OBJECTS
The goal should be to create a deterministic representation of probabilistic data that maximizes the grade of in conclusion-application built on deterministic data. We explore this type of determination problem poor two different computer tasks triggers and selection queries. A much better approach ought to be to design customized determination techniques that pick a determined representation which maximizes the grade of in conclusion-application. Probabilistic data may be created by automated data analysis/enrichment means of example entity resolution, information extraction, and speech processing. Rather, we produce a query-aware strategy and show its advantages over existing solutions employing a comprehensive empirical evaluation over real and artificial datasets. The legacy system may match pre-existing web programs for instance Flickr, Picasa, etc. This paper views the problem of exercising probabilistic data allowing such data to acquire stored in legacy systems that accept only deterministic input. We show way of example thresholding or top-1 selection typically useful for determination lead to suboptimal performance for such programs
Computer Aided Verification
This open access two-volume set LNCS 13371 and 13372 constitutes the refereed proceedings of the 34rd International Conference on Computer Aided Verification, CAV 2022, which was held in Haifa, Israel, in August 2022. The 40 full papers presented together with 9 tool papers and 2 case studies were carefully reviewed and selected from 209 submissions. The papers were organized in the following topical sections: Part I: Invited papers; formal methods for probabilistic programs; formal methods for neural networks; software Verification and model checking; hyperproperties and security; formal methods for hardware, cyber-physical, and hybrid systems. Part II: Probabilistic techniques; automata and logic; deductive verification and decision procedures; machine learning; synthesis and concurrency. This is an open access book
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Fundamental Approaches to Software Engineering
This open access book constitutes the proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 23 full papers, 1 tool paper and 6 testing competition papers presented in this volume were carefully reviewed and selected from 81 submissions. The papers cover topics such as requirements engineering, software architectures, specification, software quality, validation, verification of functional and non-functional properties, model-driven development and model transformation, software processes, security and software evolution
Tools and Algorithms for the Construction and Analysis of Systems
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers
CAMP-BDI: an approach for multiagent systems robustness through capability-aware agents maintaining plans
Rational agent behaviour is frequently achieved through the use of plans, particularly
within the widely used BDI (Belief-Desire-Intention) model for intelligent agents. As
a consequence, preventing or handling failure of planned activity is a vital component
in building robust multiagent systems; this is especially true in realistic environments,
where unpredictable exogenous change during plan execution may threaten intended
activities.
Although reactive approaches can be employed to respond to activity failure through
replanning or plan-repair, failure may have debilitative effects that act to stymie recovery
and, potentially, hinder subsequent activity. A further factor is that BDI agents typically
employ deterministic world and plan models, as probabilistic planning methods
are typical intractable in realistically complex environments. However, deterministic
operator preconditions may fail to represent world states which increase the risk of
activity failure.
The primary contribution of this thesis is the algorithmic design of the CAMP-BDI
(Capability Aware, Maintaining Plans) approach; a modification of the BDI reasoning
cycle which provides agents with beliefs and introspective reasoning to anticipate
increased risk of failure and pro-actively modify intended plans in response.
We define a capability meta-knowledge model, providing information to identify
and address threats to activity success using precondition modelling and quantitative
quality estimation. This also facilitates semantic-independent communication of capability
information for general advertisement and of dependency information - we define
use of the latter, within a structured messaging approach, to extend local agent algorithms
towards decentralized, distributed robustness. Finally, we define a policy based
approach for dynamic modification of maintenance behaviour, allowing response to
observations made during runtime and with potential to improve re-usability of agents
in alternate environments.
An implementation of CAMP-BDI is compared against an equivalent reactive system
through experimentation in multiple perturbation configurations, using a logistics
domain. Our empirical evaluation indicates CAMP-BDI has significant benefit if activity
failure carries a strong risk of debilitative consequence
Belief Representations for Planning with Contact Uncertainty
While reaching for your morning coffee you may accidentally bump into the table, yet you reroute your motion with ease and grab your cup. An effective autonomous robot will need to have a similarly seamless recovery from unexpected contact. As simple as this may seem, even sensing this contact is a challenge for many robots, and when detected contact is often treated as an error that an operator is expected to resolve. Robots operating in our daily environments will need to reason about the information they have gained from contact and replan autonomously.
This thesis examines planning under uncertainty with contact sensitive robot arms. Robots do not have skin and cannot precisely sense the location of contact. This leads to the proposed Collision Hypothesis Set model for representing a belief over the possible occupancy of the world sensed through contact. To capture the specifics of planning in an unknown world with this measurement model, this thesis develops a POMDP approach called the Blindfolded Traveler's Problem. A good prior over the possible obstacles the robot might encounter is key to effective planning. This thesis develops a neural network approach for sampling potential obstacles that are consistent with both what a robot sees from its camera and what it feels through contact.PHDRoboticsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/169845/1/bsaund_1.pd
Monte Carlo Tree Search for games with Hidden Information and Uncertainty
Monte Carlo Tree Search (MCTS) is an AI technique
that has been successfully applied to many deterministic games
of perfect information, leading to large advances in a number of domains,
such as Go and General Game Playing.
Imperfect information games are less well studied in the field of AI
despite being popular and of significant commercial interest,
for example in the case of computer and mobile adaptations of turn based board and card games.
This is largely because hidden information and uncertainty
leads to a large increase in complexity compared to perfect information games.
In this thesis MCTS is extended to games with hidden information and uncertainty
through the introduction of the Information Set MCTS (ISMCTS) family of algorithms.
It is demonstrated that ISMCTS can handle hidden information and uncertainty
in a variety of complex board and card games.
This is achieved whilst preserving the general applicability of MCTS
and using computational budgets appropriate for use in a commercial game.
The ISMCTS algorithm is shown to outperform the existing approach of Perfect Information Monte Carlo (PIMC) search.
Additionally it is shown that ISMCTS can be used to solve two known issues with PIMC search,
namely strategy fusion and non-locality.
ISMCTS has been integrated into a commercial game, Spades by AI Factory,
with over 2.5 million downloads.
The Information Capture And ReUSe (ICARUS) framework is also introduced in this thesis.
The ICARUS framework generalises MCTS enhancements in terms of information capture (from MCTS simulations)
and reuse (to improve MCTS tree and simulation policies).
The ICARUS framework is used to express existing enhancements,
to provide a tool to design new ones,
and to rigorously define how MCTS enhancements can be combined.
The ICARUS framework is tested across a wide variety of games