ﻻ يوجد ملخص باللغة العربية
If robots are ever to achieve autonomous motion comparable to that exhibited by animals, they must acquire the ability to quickly recover motor behaviors when damage, malfunction, or environmental conditions compromise their ability to move effectively. We present an approach which allowed our robots and simulated robots to recover high-degree of freedom motor behaviors within a few dozen attempts. % Our approach employs a behavior specification expressing the desired behaviors in terms as rank ordered differential constraints. We show how factoring these constraints through an encoding templates produces a recipe for generalizing a previously optimized behavior to new circumstances in a form amenable to rapid learning. We further illustrate that adequate constraints are generically easy to determine in data-driven contexts. As illustration, we demonstrate our recovery approach on a physical 7 DOF hexapod robot, as well as a simulation of a 6 DOF 2D kinematic mechanism. In both cases we recovered a behavior functionally indistinguishable from the previously optimized motion.
Autonomous missions of small unmanned aerial vehicles (UAVs) are prone to collisions owing to environmental disturbances and localization errors. Consequently, a UAV that can endure collisions and perform recovery control in critical aerial missions
Merging at highway on-ramps while interacting with other human-driven vehicles is challenging for autonomous vehicles (AVs). An efficient route to this challenge requires exploring and exploiting knowledge of the interaction process from demonstratio
We introduce reachability analysis for the formal examination of robots. We propose a novel identification method, which preserves reachset conformance of linear systems. We additionally propose a simultaneous identification and control synthesis sch
The hierarchical quadratic programming (HQP) is commonly applied to consider strict hierarchies of multi-tasks and robots physical inequality constraints during whole-body compliance. However, for the one-step HQP, the solution can oscillate when it
This paper presents an algorithmic framework for the distributed on-line source seeking, termed as DoSS, with a multi-robot system in an unknown dynamical environment. Our algorithm, building on a novel concept called dummy confidence upper bound (D-