475 research outputs found

    A Distributed Reconfigurable Control Law for Escorting and Patrolling Missions using Teams of Unicycles

    Get PDF

    A Distributed Reconfigurable Control Law for Escorting and Patrolling Missions using Teams of Unicycles

    Get PDF

    A Distributed Reconfigurable Control Law for Escorting and Patrolling Missions using Teams of Unicycles

    Get PDF

    A distributed reconfigurable control law for escorting and patrolling missions using teams of unicycles

    Get PDF
    Abstract—Recent years have seen rapidly growing interest in the development of networks of vehicles for which adaptive cooperation and autonomous execution become a necessity. In the paper, we develop a distributed reconfigurable control law to distribute unicycle-type vehicles evenly on a circle surrounding a moving target for the escorting and patrolling missions. The even distribution of the vehicles provides the best overall coverage of the target in its surroundings. It is shown that as the target moves, the group formation moves and rotates around the target to keep the target around the formation centroid. When some vehicles in the group are lost due to faults, the remaining vehicles recognize the loss and adaptively reconfigure themselves to a new evenly distributed formation

    LEAP Scratchpads: Automatic Memory and Cache Management for Reconfigurable Logic [Extended Version]

    Get PDF
    CORRECTION: The authors for entry [4] in the references should have been "E. S. Chung, J. C. Hoe, and K. Mai".Developers accelerating applications on FPGAs or other reconfigurable logic have nothing but raw memory devices in their standard toolkits. Each project typically includes tedious development of single-use memory management. Software developers expect a programming environment to include automatic memory management. Virtual memory provides the illusion of very large arrays and processor caches reduce access latency without explicit programmer instructions. LEAP scratchpads for reconfigurable logic dynamically allocate and manage multiple, independent, memory arrays in a large backing store. Scratchpad accesses are cached automatically in multiple levels, ranging from shared on-board, RAM-based, set-associative caches to private caches stored in FPGA RAM blocks. In the LEAP framework, scratchpads share the same interface as on-die RAM blocks and are plug-in replacements. Additional libraries support heap management within a storage set. Like software developers, accelerator authors using scratchpads may focus more on core algorithms and less on memory management. Two uses of FPGA scratchpads are analyzed: buffer management in an H.264 decoder and memory management within a processor microarchitecture timing model

    Coordination of Multirobot Teams and Groups in Constrained Environments: Models, Abstractions, and Control Policies

    Get PDF
    Robots can augment and even replace humans in dangerous environments, such as search and rescue and reconnaissance missions, yet robots used in these situations are largely tele-operated. In most cases, the robots\u27 performance depends on the operator\u27s ability to control and coordinate the robots, resulting in increased response time and poor situational awareness, and hindering multirobot cooperation. Many factors impede extended autonomy in these situations, including the unique nature of individual tasks, the number of robots needed, the complexity of coordinating heterogeneous robot teams, and the need to operate safely. These factors can be partly addressed by having many inexpensive robots and by control policies that provide guarantees on convergence and safety. In this thesis, we address the problem of synthesizing control policies for navigating teams of robots in constrained environments while providing guarantees on convergence and safety. The approach is as follows. We first model the configuration space of the group (a space in which the robots cannot violate the constraints) as a set of polytopes. For a group with a common goal configuration, we reduce complexity by constructing a configuration space for an abstracted group state. We then construct a discrete representation of the configuration space, on which we search for a path to the goal. Based on this path, we synthesize feedback controllers, decentralized affine controllers for kinematic systems and nonlinear feedback controllers for dynamical systems, on the polytopes, sequentially composing controllers to drive the system to the goal. We demonstrate the use of this method in urban environments and on groups of dynamical systems such as quadrotors. We reduce the complexity of multirobot coordination by using an informed graph search to simultaneously build the configuration space and find a path in its discrete representation to the goal. Furthermore, by using an abstraction on groups of robots we dissociate complexity from the number of robots in the group. Although the controllers are designed for navigation in known environments, they are indeed more versatile, as we demonstrate in a concluding simulation of six robots in a partially unknown environment with evolving communication links, object manipulation, and stigmergic interactions

    Distributed estimation techniques forcyber-physical systems

    Get PDF
    Nowadays, with the increasing use of wireless networks, embedded devices and agents with processing and sensing capabilities, the development of distributed estimation techniques has become vital to monitor important variables of the system that are not directly available. Numerous distributed estimation techniques have been proposed in the literature according to the model of the system, noises and disturbances. One of the main objectives of this thesis is to search all those works that deal with distributed estimation techniques applied to cyber-physical systems, system of systems and heterogeneous systems, through using systematic review methodology. Even though systematic reviews are not the common way to survey a topic in the control community, they provide a rigorous, robust and objective formula that should not be ignored. The presented systematic review incorporates and adapts the guidelines recommended in other disciplines to the field of automation and control and presents a brief description of the different phases that constitute a systematic review. Undertaking the systematic review many gaps were discovered: it deserves to be remarked that some estimators are not applied to cyber-physical systems, such as sliding mode observers or set-membership observers. Subsequently, one of these particular techniques was chosen, set-membership estimator, to develop new applications for cyber-physical systems. This introduces the other objectives of the thesis, i.e. to present two novel formulations of distributed set-membership estimators. Both estimators use a multi-hop decomposition, so the dynamics of the system is rewritten to present a cascaded implementation of the distributed set-membership observer, decoupling the influence of the non-observable modes to the observable ones. So each agent must find a different set for each sub-space, instead of a unique set for all the states. Two different approaches have been used to address the same problem, that is, to design a guaranteed distributed estimation method for linear full-coupled systems affected by bounded disturbances, to be implemented in a set of distributed agents that need to communicate and collaborate to achieve this goal

    A methodology for rapid vehicle scaling and configuration space exploration

    Get PDF
    Drastic changes in aircraft operational requirements and the emergence of new enabling technologies often occur symbiotically with advances in technology inducing new requirements and vice versa. These changes sometimes lead to the design of vehicle concepts for which no prior art exists. They lead to revolutionary concepts. In such cases the basic form of the vehicle geometry can no longer be determined through an ex ante survey of prior art as depicted by aircraft concepts in the historical domain. Ideally, baseline geometries for revolutionary concepts would be the result of exhaustive configuration space exploration and optimization. Numerous component layouts and their implications for the minimum external dimensions of the resultant vehicle would be evaluated. The dimensions of the minimum enclosing envelope for the best component layout(s) (as per the design need) would then be used as a basis for the selection of a baseline geometry. Unfortunately layout design spaces are inherently large and the key contributing analysis i.e. collision detection, can be very expensive as well. Even when an appropriate baseline geometry has been identified, another hurdle i.e. vehicle scaling has to be overcome. Through the design of a notional Cessna C-172R powered by a liquid hydrogen Proton Exchange Membrane (PEM) fuel cell, it has been demonstrated that the various forms of vehicle scaling i.e. photographic and historical-data-based scaling can result in highly sub-optimal results even for very small O(10-3) scale factors. There is therefore a need for higher fidelity vehicle scaling laws especially since emergent technologies tend to be volumetrically and/or gravimetrically constrained when compared to incumbents. The Configuration-space Exploration and Scaling Methodology (CESM) is postulated herein as a solution to the above-mentioned challenges. This bottom-up methodology entails the representation of component or sub-system geometries as matrices of points in 3D space. These typically large matrices are reduced using minimal convex sets or convex hulls. This reduction leads to significant gains in collision detection speed at minimal approximation expense. (The Gilbert-Johnson-Keerthi algorithm is used for collision detection purposes in this methodology.) Once the components are laid out, their collective convex hull (from here on out referred to as the super-hull) is used to approximate the inner mold line of the minimum enclosing envelope of the vehicle concept. A sectional slicing algorithm is used to extract the sectional dimensions of this envelope. An offset is added to these dimensions in order to come up with the sectional fuselage dimensions. Once the lift and control surfaces are added, vehicle level objective functions can be evaluated and compared to other designs. For each design, changes in the super-hull dimensions in response to perturbations in requirements can be tracked and regressed to create custom geometric scaling laws. The regressions are based on dimensionally consistent parameter groups in order to come up with dimensionally consistent and thus physically meaningful laws. CESM enables the designer to maintain design freedom by portably carrying multiple designs deeper into the design process. Also since CESM is a bottom-up approach, all proposed baseline concepts are implicitly volumetrically feasible. Furthermore the scaling laws developed from custom data for each concept are subject to less design noise than say, regression based approaches. Through these laws, key physics-based characteristics of vehicle subsystems such as energy density can be mapped onto key system level metrics such as fuselage volume or take-off gross weight. These laws can then substitute some historical-data based analyses thereby improving the fidelity of the analyses and reducing design time.Ph.D.Committee Chair: Dr. Dimitri Mavris; Committee Member: Dean Ward; Committee Member: Dr. Daniel Schrage; Committee Member: Dr. Danielle Soban; Committee Member: Dr. Sriram Rallabhandi; Committee Member: Mathias Emenet
    • …
    corecore