23 research outputs found
Task-driven Modular Co-design of Vehicle Control Systems
When designing autonomous systems, we need to consider multiple trade-offs at
various abstraction levels, and the choices of single (hardware and software)
components need to be studied jointly. In this work we consider the problem of
designing the control algorithm as well as the platform on which it is
executed. In particular, we focus on vehicle control systems, and formalize
state-of-the-art control schemes as monotone feasibility relations. We then
show how, leveraging a monotone theory of co-design, we can study the embedding
of control synthesis problems into the task-driven co-design problem of a
robotic platform. The properties of the proposed approach are illustrated by
considering urban driving scenarios. We show how, given a particular task, we
can efficiently compute Pareto optimal design solutions.Comment: 8 pages, 7 figures. Proceedings of the 2022 IEEE 61th Conference on
Decision and Contro
Co-Design of Autonomous Systems: From Hardware Selection to Control Synthesis
Designing cyber-physical systems is a complex task which requires insights at
multiple abstraction levels. The choices of single components are deeply
interconnected and need to be jointly studied. In this work, we consider the
problem of co-designing the control algorithm as well as the platform around
it. In particular, we leverage a monotone theory of co-design to formalize
variations of the LQG control problem as monotone feasibility relations. We
then show how this enables the embedding of control co-design problems in the
higher level co-design problem of a robotic platform. We illustrate the
properties of our formalization by analyzing the co-design of an autonomous
drone performing search-and-rescue tasks and show how, given a set of desired
robot behaviors, we can compute Pareto efficient design solutions.Comment: 8 pages, 6 figures, to appear in the proceedings of the 20th European
Control Conference (ECC21
A Power-Performance Approach to Comparing Sensor Families, with application to comparing neuromorphic to traditional vision sensors
Abstract—There is considerable freedom in choosing the sensors to be equipped on a robot. Currently many sensing technologies are available (radar, lidar, vision sensors, time-of-flight cameras, etc.). For each class, there are additional choices regarding the exact sensor parameters (spatial resolution, frame rate, etc.). Which sensor is best? In general, this question needs to be qualified. It depends on the task. In an estimation task, the answer depends on the prior for the signal. In a control task, the answer depends exactly on which are the sufficient statistics for computing the control signal. This paper shows that an ulterior qualification that needs to be made: the answer depends on the power available for sensing, even when the task is fixed. We define the “power-performance ” curve as the performance attainable on a task for a given level of sensing power. We show that this approach is well suited to comparing a traditional CMOS sensor with the recently available “neuromorphic ” sensors. We discuss estimation tasks with different priors for the signal. We find priors for which one sensor dominates the other and vice-versa, priors for which they are equivalent, and priors for which the answer depends on the power available. This shows that comparing sensors is a quite delicate problem. It also suggests that the optimal architecture might have more that one sensor, and would switch sensors on and off according to the performance level required instantaneously. I
Comparison of constrained geometric approximation strategies for planar information states
Abstract-This paper describes and analyzes a new technique for reasoning about uncertainty called constrained geometric approximation (CGA). We build upon recent work that has developed methods to explicitly represent a robot's knowledge as an element, called an information state, in an appropriately defined information space. The intuition of our new approach is to constrain the I-state to remain in a structured subset of the I-space, and to enforce that constraint using appropriate overapproximation methods. The result is a collection of algorithms that enable mobile robots with extreme limitations in both sensing and computation to maintain simple but provably meaningful representations of the incomplete information available to them. We present a simulated implementation of this technique for a sensor-based navigation task, along with experimental results for this task showing that CGA, compared to a highfidelity representation of the un-approximated I-state, achieves a similar success rate at a small fraction of the computational cost