Autonomous Robots最新文献

This paper explores range and bearing angle regulation of a leader–follower using monocular vision. The main challenge is that monocular vision does not directly provide a range measurement. The contribution is a novel concurrent learning (CL) approach, called CL Subtended Angle and Bearing Estimator for Relative pose (CL-SABER), which achieves range regulation without communication, persistency of excitation or known geometry and is demonstrated on a physical, robot platform. A history stack estimates target size which augments the Kalman filter (KF) with a range pseudomeasurement. The target is followed to scale without drift, persistency of excitation requirements, prior knowledge, or additional measurements. Finite excitation is required to achieve parameter convergence and perform steady-state regulation using CL-SABER. Evaluation using simulation and mobile robot experiments in special Euclidean planar space (SE(2)) show that the new method provides stable and consistent range regulation, as demonstrated by the inter-rater reliability, including in noisy and high leader acceleration environments.

Inertial-aided systems require continuous motion excitation among other reasons to characterize the measurement biases that will enable accurate integration required for localization frameworks. This paper proposes the use of informative path planning to find the best trajectory for minimizing the uncertainty of IMU biases and an adaptive traces method to guide the planner towards trajectories that aid convergence. The key contribution is a novel regression method based on Gaussian Process (GP) to enforce continuity and differentiability between waypoints from a variant of the (hbox {RRT}^*) planning algorithm. We employ linear operators applied to the GP kernel function to infer not only continuous position trajectories, but also velocities and accelerations. The use of linear functionals enable velocity and acceleration constraints given by the IMU measurements to be imposed on the position GP model. The results from both simulation and real-world experiments show that planning for IMU bias convergence helps minimize localization errors in state estimation frameworks.

The process-aware source seeking (PASS) problem in flow fields aims to find an informative trajectory to reach an unknown source location while taking the energy consumption in the flow fields into consideration. Taking advantage of the dynamic flow field partition technique, this paper formulates this problem as a task and motion planning (TAMP) problem and proposes a bi-level hierarchical planning framework to decouple the planning of inter-region transition and inner-region trajectory by introducing inter-region junctions. An integrated strategy is developed to enable efficient upper-level planning by investigating the optimal solution of the lower-level planner. In order to leverage the information acquisition and computational burden, a dynamic event-triggered mechanism is introduced to enable asynchronized estimation, region partitioning and re-plans. The proposed algorithm provides guaranteed convergence of the trajectory, and achieves automatic trade-offs of both exploration-exploitation and accuracy-efficiency. Simulations in a highly complicated and realistic ocean surface flow field validate the merits of the proposed algorithm, which demonstrates a significant reduction in computational burden without compromising planning optimality.

This paper proposes an innovative approach for optical flow-based control of micro air vehicles (MAVs), addressing challenges inherent in the nonlinearity of optical flow observables. The proposed incremental nonlinear dynamic inversion (INDI) control scheme employs an efficient data-driven approach to directly estimate the inverse of the time-varying INDI control effectiveness in real-time. This method eliminates the constant effectiveness assumption typically made by traditional INDI methods and reduces the computational burden associated with inverting this variable at each time step. It effectively handles rapidly changing system dynamics, often encountered in optical flow-based control, particularly height-dependent control variables. Stability analysis of the proposed control scheme is conducted, and its robustness and efficiency are demonstrated through both numerical simulations and real-world flight tests. These tests include multiple landings of an MAV on a static, flat surface with several different tracking setpoints, as well as hovering and landings on moving and undulating surfaces. Despite the challenges posed by noisy optical flow estimates and lateral or vertical movements of the landing surfaces, the MAV successfully tracks or lands on the surface with an exponential decay of both height and vertical velocity almost simultaneously, aligning with the desired performance.

In this paper, we present models and planning algorithms to slide an object on a planar surface via frictional patch contact made with its top surface, whether the surface is horizontal or inclined. The core of our approach is the asymmetric dual limit surfaces model that determines slip boundary conditions for both the top and support patch contacts made with the object. This model enables us to compute a range of twists that can keep the object in sticking contact with the robot end-effector while slipping on the supporting plane. Based on these constraints, we derive a planning algorithm to slide objects with only top contact to arbitrary goal poses without slippage between end effector and the object. We fit the proposed model and demonstrate its predictive accuracy on a variety of object geometries and motions. We also evaluate the planning algorithm over a variety of objects and goals, demonstrating an orientation error improvement of 90% when compared to methods naive to linear path planners. For more results and information, please visit https://www.mmintlab.com/dual-limit-surfaces/.

Trust is a crucial factor for effective human–robot teaming. Existing literature on trust modeling predominantly focuses on dyadic human-autonomy teams where one human agent interacts with one robot. There is little, if not no, research on trust modeling in teams consisting of multiple human and robotic agents. To fill this important research gap, we present the Trust Inference and Propagation (TIP) model to model and estimate human trust in multi-human multi-robot teams. In a multi-human multi-robot team, we postulate that there exist two types of experiences that a human agent has with a robot: direct and indirect experiences. The TIP model presents a novel mathematical framework that explicitly accounts for both types of experiences. To evaluate the model, we conducted a human-subject experiment with 15 pairs of participants ((N=30)). Each pair performed a search and detection task with two drones. Results show that our TIP model successfully captured the underlying trust dynamics and significantly outperformed a baseline model. To the best of our knowledge, the TIP model is the first mathematical framework for computational trust modeling in multi-human multi-robot teams.

Swarm algorithms promise to solve certain problems in large multi-robot systems. The evaluation of large swarms is however challenging as simulations alone often lack some properties of real systems whereas real-world experiments are costly and complex. We present a mixed reality (MR) system that connects simulated and physical robots though a 5G network, facilitating MR experiments to evaluate communication-based swarm algorithms. The effectiveness of the system is demonstrated through extensive experiments with unmanned aerial vehicles. Measurements show that the communication requirements of swarm coordination are well met by 5G but the computing power of the simulation server can be a bottleneck. However, even when the simulation slows down, communication and coordination take place in real time. In conclusion, 5G-enabled MR experiments are a feasible tool for bridging the reality gap in the development and evaluation of robot swarms.

The exploration of new environments is a crucial challenge for mobile robots. This task becomes even more complex with the added requirement of ensuring safety. Here, safety refers to the robot staying in regions where the values of certain environmental conditions (such as terrain steepness or radiation levels) are within a predefined threshold. We consider two types of safe exploration problems. First, the robot has a map of its workspace, but the values of the environmental features relevant to safety are unknown beforehand and must be explored. Second, both the map and the environmental features are unknown, and the robot must build a map whilst remaining safe. Our proposed framework uses a Gaussian process to predict the value of the environmental features in unvisited regions. We then build a Markov decision process that integrates the Gaussian process predictions with the transition probabilities of the environmental model. The Markov decision process is then incorporated into an exploration algorithm that decides which new region of the environment to explore based on information value, predicted safety, and distance from the current position of the robot. We empirically evaluate the effectiveness of our framework through simulations and its application on a physical robot in an underground environment.

We present a method for enabling Reinforcement Learning of motor control policies for complex skills such as dexterous manipulation. We posit that a key difficulty for training such policies is the difficulty of exploring the problem state space, as the accessible and useful regions of this space form a complex structure along manifolds of the original high-dimensional state space. This work presents a method to enable and support exploration with Sampling-based Planning. We use a generally applicable non-holonomic Rapidly-exploring Random Trees algorithm and present multiple methods to use the resulting structure to bootstrap model-free Reinforcement Learning. Our method is effective at learning various challenging dexterous motor control skills of higher difficulty than previously shown. In particular, we achieve dexterous in-hand manipulation of complex objects while simultaneously securing the object without the use of passive support surfaces. These policies also transfer effectively to real robots. A number of example videos can also be found on the project website: sbrl.cs.columbia.edu

Programmable matter refers to material that can be programmed to alter its physical properties, including its shape. Such matter can be built as a lattice of attached robotic modules, each seen as an autonomous agent with communication and motion capabilities. Self-reconfiguration consists in changing the initial arrangement of modules to form a desired goal shape, and is known to be a complex problem due to its algorithmic complexity and motion constraints. In this paper, we propose to use a max-flow algorithm as a centralized global planner to determine the concurrent paths to be traversed by modules through a porous structure composed of 3D Catoms meta-modules with the aim of increasing the parallelism of motions, and hence decreasing the self-reconfiguration time. We implement a traffic light system as a distributed asynchronous local planning algorithm to control the motions to avoid collisions. We evaluated our algorithm using VisibleSim simulator on different self-reconfiguration scenarios and compared the performance with an existing fully distributed synchronous self-reconfiguration algorithm for similar structures. The results show that the new method provides a significant gain in self-reconfiguration time and energy efficiency.