Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

A study of anticipatory non-autonomous systems

Rhythms are manifested ubiquitously in dynamical biological processes. These fundamental processes which are necessary for the survival of living organisms include metabolism, breathing, heart beat, and, above all, the circadian rhythm coupled to the diurnal cycle. Thus, in mathematical biology, biological processes are often represented as linear or nonlinear oscillators. In the framework of nonlinear and dissipative systems (ie. the flow of energy, substances, or sensory information), they generate stable internal oscillations as a response to environmental input and, in turn, utilise such output as a means of coupling with the environment.

Lower semicontinuity of attractors for non-autonomous dynamical systems

This paper is concerned with the lower semicontinuity of attractors for semilinear non-autonomous differential equations in Banach spaces. We require the unperturbed attractor to be given as the union of unstable manifolds of time-dependent hyperbolic solutions, generalizing previous results valid only for gradient-like systems in which the hyperbolic solutions are equilibria. The tools employed are a study of the continuity of the local unstable manifolds of the hyperbolic solutions and results on the continuity of the exponential dichotomy of the linearization around each of these solutions.

A Floating-point Extended Kalman Filter Implementation for Autonomous Mobile Robots

Localization and Mapping are two of the most important capabilities for autonomous mobile robots and have been receiving considerable attention from the scientific computing community over the last 10 years. One of the most efficient methods to address these problems is based on the use of the Extended Kalman Filter (EKF). The EKF simultaneously estimates a model of the environment (map) and the position of the robot based on odometric and exteroceptive sensor information. As this algorithm demands a considerable amount of computation, it is usually executed on high end PCs coupled to the robot. In this work we present an FPGA-based architecture for the EKF algorithm that is capable of processing two-dimensional maps containing up to 1.8 k features at real time (14 Hz), a three-fold improvement over a Pentium M 1.6 GHz, and a 13-fold improvement over an ARM920T 200 MHz. The proposed architecture also consumes only 1.3% of the Pentium and 12.3% of the ARM energy per feature.

Modelling the Provenance of Data in Autonomous Systems

Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be demonstrably rigorous for the result to be deemed reliable. A provenance system supports applications in recording adequate documentation about process executions to answer queries regarding provenance, and provides functionality to perform those queries. Several provenance systems are being developed, but all focus on systems in which the components are textitreactive, for example Web Services that act on the basis of a request, job submission system, etc. This limitation means that questions regarding the motives of autonomous actors, or textitagents, in such systems remain unanswerable in the general case. Such questions include: who was ultimately responsible for a given effect, what was their reason for initiating the process and does the effect of a process match what was intended to occur by those initiating the process? In this paper, we address this limitation by integrating two solutions: a generic, re-usable framework for representing the provenance of data in service-oriented architectures and a model for describing the goal-oriented delegation and engagement of agents in multi-agent systems. Using these solutions, we present algorithms to answer common questions regarding responsibility and success of a process and evaluate the approach with a simulated healthcare example.

Estratégias baseadas em aprendizado para coordenação de uma frota de robôs em tarefas cooperativas

In multi-robot systems, both control architecture and work strategy represent a challenge for researchers. It is important to have a robust architecture that can be easily adapted to requirement changes. It is also important that work strategy allows robots to complete tasks efficiently, considering that robots interact directly in environments with humans. In this context, this work explores two approaches for robot soccer team coordination for cooperative tasks development. Both approaches are based on a combination of imitation learning and reinforcement learning. Thus, in the first approach was developed a control architecture, a fuzzy inference engine for recognizing situations in robot soccer games, a software for narration of robot soccer games based on the inference engine and the implementation of learning by imitation from observation and analysis of others robotic teams. Moreover, state abstraction was efficiently implemented in reinforcement learning applied to the robot soccer standard problem. Finally, reinforcement learning was implemented in a form where actions are explored only in some states (for example, states where an specialist robot system used them) differently to the traditional form, where actions have to be tested in all states. In the second approach reinforcement learning was implemented with function approximation, for which an algorithm called RBF-Sarsa($lambda$) was created. In both approaches batch reinforcement learning algorithms were implemented and imitation learning was used as a seed for reinforcement learning. Moreover, learning from robotic teams controlled by humans was explored. The proposal in this work had revealed efficient in the robot soccer standard problem and, when implemented in other robotics systems, they will allow that these robotics systems can efficiently and effectively develop assigned tasks. These approaches will give high adaptation capabilities to requirements and environment changes.

Autonomous mobile robots designing for the medical trash collector task

This paper describes the UNESP robotic team in the medical trash collector task, proposed on the 5 rd IEEE Latin American Robots Competition in the LEGO category. We present our understanding of the task and discuss the proposed solution, focusing on the mechanical and computational issues of the robots. The mechanics is based on rigid body capability of transforming rotational into curvilinear movement. With respect to the computational control, the system is modeled as a reactive system with sequential transition of behaviors. A state-machine is proposed to allow this transition, and the synchronization of robotic states is guaranteed by the communication system. The proposed approach has shown itself capable of dealing with the high difficulty degree of this cooperative task. ©2006 IEEE.

Networked control system for the guidance of a four-wheel steering agricultural robotic platform

A current trend in the agricultural area is the development of mobile robots and autonomous vehicles for precision agriculture (PA). One of the major challenges in the design of these robots is the development of the electronic architecture for the control of the devices. In a joint project among research institutions and a private company in Brazil a multifunctional robotic platform for information acquisition in PA is being designed. This platform has as main characteristics four-wheel propulsion and independent steering, adjustable width, span of 1,80m in height, diesel engine, hydraulic system, and a CAN-based networked control system (NCS). This paper presents a NCS solution for the platform guidance by the four-wheel hydraulic steering distributed control. The control strategy, centered on the robot manipulators control theory, is based on the difference between the desired and actual position and considering the angular speed of the wheels. The results demonstrate that the NCS was simple and efficient, providing suitable steering performance for the platform guidance. Even though the simplicity of the NCS solution developed, it also overcame some verified control challenges in the robot guidance system design such as the hydraulic system delay, nonlinearities in the steering actuators, and inertia in the steering system due the friction of different terrains. Copyright © 2012 Eduardo Pacincia Godoy et al.

A Generic Autonomous Clustering-Based Heterogeneous Waveband Switching Architecture in WDM Networks

Heterogeneous waveband switching (HeteroWBS) in WDM networks reduces the network operational costs. We propose an autonomous clustering-based HeteroWBS architecture to support the design of efficient HeteroWBS algorithms under dynamic traffic requests in such a network.

Characterization of Stability Region for General Autonomous Nonlinear Dynamical Systems

The existing characterization of stability regions was developed under the assumption that limit sets on the stability boundary are exclusively composed of hyperbolic equilibrium points and closed orbits. The characterizations derived in this technical note are a generalization of existing results in the theory of stability regions. A characterization of the stability boundary of general autonomous nonlinear dynamical systems is developed under the assumption that limit sets on the stability boundary are composed of a countable number of disjoint and indecomposable components, which can be equilibrium points, closed orbits, quasi-periodic solutions and even chaotic invariant sets.

TYPE-ZERO SADDLE-NODE BIFURCATIONS AND STABILITY REGION ESTIMATION OF NONLINEAR AUTONOMOUS DYNAMICAL SYSTEMS

A complete characterization of the stability boundary of a class of nonlinear dynamical systems that admit energy functions is developed in this paper. This characterization generalizes the existing results by allowing the type-zero saddle-node nonhyperbolic equilibrium points on the stability boundary. Conceptual algorithms to obtain optimal estimates of the stability region (basin of attraction) in the form of level sets of a given family of energy functions are derived. The behavior of the stability region and the corresponding estimates are investigated for parameter variation in the neighborhood of a type-zero saddle-node bifurcation value.

Stability boundary characterization of nonlinear autonomous dynamical systems in the presence of saddle-node equilibrium points

A dynamical characterization of the stability boundary for a fairly large class of nonlinear autonomous dynamical systems is developed in this paper. This characterization generalizes the existing results by allowing the existence of saddle-node equilibrium points on the stability boundary. The stability boundary of an asymptotically stable equilibrium point is shown to consist of the stable manifolds of the hyperbolic equilibrium points on the stability boundary and the stable, stable center and center manifolds of the saddle-node equilibrium points on the stability boundary.

Interactions between normative systems and software cognitive agents. A formalization in temporal modal defeasible logic and its implementation

Sustainable computer systems require some flexibility to adapt to environmental unpredictable changes. A solution lies in autonomous software agents which can adapt autonomously to their environments. Though autonomy allows agents to decide which behavior to adopt, a disadvantage is a lack of control, and as a side effect even untrustworthiness: we want to keep some control over such autonomous agents. How to control autonomous agents while respecting their autonomy? A solution is to regulate agents’ behavior by norms. The normative paradigm makes it possible to control autonomous agents while respecting their autonomy, limiting untrustworthiness and augmenting system compliance. It can also facilitate the design of the system, for example, by regulating the coordination among agents. However, an autonomous agent will follow norms or violate them in some conditions. What are the conditions in which a norm is binding upon an agent? While autonomy is regarded as the driving force behind the normative paradigm, cognitive agents provide a basis for modeling the bindingness of norms. In order to cope with the complexity of the modeling of cognitive agents and normative bindingness, we adopt an intentional stance. Since agents are embedded into a dynamic environment, things may not pass at the same instant. Accordingly, our cognitive model is extended to account for some temporal aspects. Special attention is given to the temporal peculiarities of the legal domain such as, among others, the time in force and the time in efficacy of provisions. Some types of normative modifications are also discussed in the framework. It is noteworthy that our temporal account of legal reasoning is integrated to our commonsense temporal account of cognition. As our intention is to build sustainable reasoning systems running unpredictable environment, we adopt a declarative representation of knowledge. A declarative representation of norms will make it easier to update their system representation, thus facilitating system maintenance; and to improve system transparency, thus easing system governance. Since agents are bounded and are embedded into unpredictable environments, and since conflicts may appear amongst mental states and norms, agent reasoning has to be defeasible, i.e. new pieces of information can invalidate formerly derivable conclusions. In this dissertation, our model is formalized into a non-monotonic logic, namely into a temporal modal defeasible logic, in order to account for the interactions between normative systems and software cognitive agents.

Control concept for autonomous changeable material flow systems

Today’s material flow systems for mass customization or dynamic productions are usually realized with manual transportation systems. However new concepts in the domain of material flow and device control like function-oriented modularization and intelligent multi-agent-systems offer the possibility to employ changeable and automated material flow systems in dynamic production structures. These systems need the ability to react on unplanned and unexpected events autonomously.