30,604 research outputs found
Dynamic Controllability Made Simple
Simple Temporal Networks with Uncertainty (STNUs) are a well-studied model for representing temporal constraints, where some intervals (contingent links) have an unknown but bounded duration, discovered only during execution. An STNU is dynamically controllable (DC) if there exists a strategy to execute its time-points satisfying all the constraints, regardless of the actual duration of contingent links revealed during execution.
In this work we present a new system of constraint propagation rules for STNUs, which is sound-and-complete for DC checking. Our system comprises just three rules which, differently from the ones proposed in all previous works, only generate unconditioned constraints. In particular, after applying our sound rules, the network remains an STNU in all respects. Moreover, our completeness proof is short and non-algorithmic, based on the explicit construction of a valid execution strategy. This is a substantial simplification of the theory which underlies all the polynomial-time algorithms for DC-checking.
Our analysis also shows: (1) the existence of late execution strategies for STNUs, (2) the equivalence of several variants of the notion of DC, (3) the existence of a fast algorithm for real-time execution of STNUs, which runs in O(KN) total time in a network with K contingent links and N time points, considerably improving the previous O(N^3)-time bound
Simplified modelling of air source heat pumps producing detailed results
Created by the Building Research Establishment (BRE), the Standard Assessment Procedure (SAP) is the UK Government‟s recommended method of assessing the energy ratings of dwellings. Modelling future complex dwellings, and their servicing systems, will require a more advanced calculation which is as simple as SAP to use but can produce more detailed results. This paper extends a novel advanced dynamic calculation method (IDEAS – Inverse Dynamics based Energy Analysis and Simulation) of assessing the controllability of a building and its servicing systems. IDEAS produces SAP compliant results and allows confident (i.e. calibrated in SAP) predictions to be made regarding the impact of novel heating and renewable energy systems. This paper describes the addition of an Air Source Heat Pump (ASHP) model to IDEAS. This allows for detailed analysis to be made of ASHPs in a SAP compliant framework. The benefits of using the IDEAS method is highlighted with capabilities outwith the scope of SAP also possible. For example, IDEAS can be used as sizing tool for a heating system in a building
Optimising Flexibility of Temporal Problems with Uncertainty
Temporal networks have been applied in many autonomous systems.
In real situations, we cannot ignore the uncertain factors when
using those autonomous systems. Achieving robust schedules and
temporal plans by optimising flexibility to tackle the
uncertainty is the motivation of the thesis.
This thesis focuses on the optimisation problems of temporal
networks with uncertainty and controllable options in the field
of Artificial Intelligence Planning and Scheduling. The goal of
this thesis is to construct flexibility and robustness metrics
for temporal networks under the constraints of different levels
of controllability. Furthermore, optimising flexibility for
temporal plans and schedules to achieve robust solutions with
flexible executions.
When solving temporal problems with uncertainty, postponing
decisions according to the observations of uncertain events
enables flexible strategies as the solutions instead of fixed
schedules or plans. Among the three levels of controllability of
the Simple Temporal Problem with Uncertainty (STPU), a problem is
dynamically controllable if there is a successful dynamic
strategy such that every decision in it is made according to the
observations of past events.
In the thesis, we make the following contributions. (1) We
introduce an optimisation model for STPU based on the existing
dynamic controllability checking algorithms. Some flexibility and
robustness measures are introduced based on the model. (2) We
extend the definition and verification algorithm of dynamic
controllability to temporal problems with controllable discrete
variables and uncertainty, which is called Controllable
Conditional Temporal Problems with Uncertainty (CCTPU). An
entirely dynamically controllable strategy of CCTPU consists of
both temporal scheduling and variable assignments being
dynamically decided, which maximize the flexibility of the
execution. (3) We introduce optimisation models of CCTPU under
fully dynamic controllability. The optimisation models aim to
answer the questions how flexible, robust or controllable a
schedule or temporal plan is. The experiments show that making
decisions dynamically can achieve better objective values than
doing statically.
The thesis also contributes to the field of AI planning and
scheduling by introducing robustness metrics of temporal
networks, proposing an envelope-based algorithm that can check
dynamic controllability of temporal networks with uncertainty and
controllable discrete decisions, evaluating improvements from
making decisions strongly controllable to temporally dynamically
controllable and fully dynamically controllable and comparing the
runtime of different implementations to present the scalability
of dynamically controllable strategies
Controllability of a swarm of topologically interacting autonomous agents
Controllability of complex networks has been the focal point of many recent
studies in the field of complexity. These landmark advances shed a new light on
the dynamics of natural and technological complex systems. Here, we analyze the
controllability of a swarm of autonomous self-propelled agents having a
topological neighborhood of interactions, applying the analytical tools
developed for the study of the controllability of arbitrary complex directed
networks. To this aim we thoroughly investigate the structural properties of
the swarm signaling network which is the information transfer channel
underpinning the dynamics of agents in the physical space. Our results show
that with 6 or 7 topological neighbors, every agent not only affects, but is
also affected by all other agents within the group. More importantly, still
with 6 or 7 topological neighbors, each agent is capable of full control over
all other agents. This finding is yet another argument justifying the
particular value of the number of topological neighbors observed in field
observations with flocks of starlings.Comment: 9 pages, 3 figures. arXiv admin note: text overlap with
arXiv:1401.259
Uncertainty in Soft Temporal Constraint Problems:A General Framework and Controllability Algorithms forThe Fuzzy Case
In real-life temporal scenarios, uncertainty and preferences are often
essential and coexisting aspects. We present a formalism where quantitative
temporal constraints with both preferences and uncertainty can be defined. We
show how three classical notions of controllability (that is, strong, weak, and
dynamic), which have been developed for uncertain temporal problems, can be
generalized to handle preferences as well. After defining this general
framework, we focus on problems where preferences follow the fuzzy approach,
and with properties that assure tractability. For such problems, we propose
algorithms to check the presence of the controllability properties. In
particular, we show that in such a setting dealing simultaneously with
preferences and uncertainty does not increase the complexity of controllability
testing. We also develop a dynamic execution algorithm, of polynomial
complexity, that produces temporal plans under uncertainty that are optimal
with respect to fuzzy preferences
Resilience and Controllability of Dynamic Collective Behaviors
The network paradigm is used to gain insight into the structural root causes
of the resilience of consensus in dynamic collective behaviors, and to analyze
the controllability of the swarm dynamics. Here we devise the dynamic signaling
network which is the information transfer channel underpinning the swarm
dynamics of the directed interagent connectivity based on a topological
neighborhood of interactions. The study of the connectedness of the swarm
signaling network reveals the profound relationship between group size and
number of interacting neighbors, which is found to be in good agreement with
field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl.
Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic
collective behaviors enabling us to uncover that the swarm signaling network is
a homogeneous clustered small-world network, thus facilitating emergent
outcomes if connectedness is maintained. Resilience of the emergent consensus
is tested by introducing exogenous environmental noise, which ultimately
stresses how deeply intertwined are the swarm dynamics in the physical and
network spaces. The availability of the signaling network allows us to
analytically establish for the first time the number of driver agents necessary
to fully control the swarm dynamics
The power dissipation method and kinematic reducibility of multiple-model robotic systems
This paper develops a formal connection between the power dissipation method (PDM) and Lagrangian mechanics, with specific application to robotic systems. Such a connection is necessary for understanding how some of the successes in motion planning and stabilization for smooth kinematic robotic systems can be extended to systems with frictional interactions and overconstrained systems. We establish this connection using the idea of a multiple-model system, and then show that multiple-model systems arise naturally in a number of instances, including those arising in cases traditionally addressed using the PDM. We then give necessary and sufficient conditions for a dynamic multiple-model system to be reducible to a kinematic multiple-model system. We use this result to show that solutions to the PDM are actually kinematic reductions of solutions to the Euler-Lagrange equations. We are particularly motivated by mechanical systems undergoing multiple intermittent frictional contacts, such as distributed manipulators, overconstrained wheeled vehicles, and objects that are manipulated by grasping or pushing. Examples illustrate how these results can provide insight into the analysis and control of physical systems
- …