Search

Simultaneous localization and planning (SLAP) is a crucial ability for an autonomous robot operating under uncertainty. In its most general form, SLAP induces a continuous partially observable Markov decision process (POMDP), which needs to be repeatedly solved online. This paper addresses this problem and proposes a dynamic replanning scheme in belief space. The underlying POMDP, which is continuous in state, action, and observation space, is approximated offline via sampling-based methods, but operates in a replanning loop online to admit local improvements to the coarse offline policy. This construct enables the proposed method to combat changing environments and large localization errors, even when the change alters the homotopy class of the optimal trajectory. It further outperforms the state-of-the-art Feedback-based Information RoadMap (FIRM) method by eliminating unnecessary stabilization steps. Applying belief space planning to physical systems brings with it a plethora of challenges. A key focus of this paper is to implement the proposed planner on a physical robot and show the SLAP solution performance under uncertainty, in changing environments and in the presence of large disturbances, such as a kidnapped robot situation. [ABSTRACT FROM AUTHOR]

In this paper, we derive an algorithm for enabling a single robotic unmanned aerial vehicle to herd a flock of birds away from a designated volume of space, such as the air space around an airport. The herding algorithm, referred to as the $m$ -waypoint algorithm, is designed using a dynamic model of bird flocking based on Reynolds’ rules. We derive bounds on its performance using a combination of reduced-order modeling of the flock's motion, heuristics, and rigorous analysis. A unique contribution of the paper is the experimental demonstration of several facets of the herding algorithm on flocks of live birds reacting to a robotic pursuer. The experiments allow us to estimate several parameters of the flocking model, and especially the interaction between the pursuer and the flock. The herding algorithm is also demonstrated using numerical simulations. [ABSTRACT FROM AUTHOR]

The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas. [ABSTRACT FROM AUTHOR]

The ability to anticipate a fall is fundamental for any robot that has to balance. Currently, fast fall-prediction algorithms only exist for simple models, such as the linear inverted pendulum model (LIPM), whose validity breaks down in multicontact scenarios (i.e., when contacts are not limited to a flat ground). This paper presents a fast fall-prediction algorithm based on the point-mass model, which remains valid in multicontact scenarios. The key assumption of our algorithm is that, in order to come to a stop without changing its contacts, a robot only needs to accelerate its center of mass in the direction opposite to its velocity. This assumption allows us to predict the fall by means of a convex optimal control problem, which we solve with a fast custom algorithm (less than 11 ms of computation time). We validated the approach through extensive simulations with the humanoid robot HRP-2 in randomly-sampled scenarios. Comparisons with standard LIPM-based methods demonstrate the superiority of our algorithm in predicting the fall of the robot, when controlled with a state-of-the-art balance controller. This paper lays the foundations for the solution of the challenging problem of push recovery in multicontact scenarios. [ABSTRACT FROM AUTHOR]

This paper proposes deployment strategies for consumer unmanned aerial vehicles (UAVs) to maximize the stationary coverage of a target area and to guarantee the continuity of the service through energy replenishment operations at ground charging stations. The three main contributions of our work are as follows. 1) A centralized optimal solution is proposed for the joint problem of UAV positioning for a target coverage ratio and scheduling the charging operations of the UAVs that involves travel to the ground station. 2) A distributed game-theory-based scheduling strategy is proposed using normal-form games with rigorous analysis on performance bounds. Furthermore, a bio-inspired scheme using attractive/repulsive spring actions are used for distributed positioning of the UAVs. 3) The cost-benefit tradeoffs of different levels of cooperation among the UAVs for the distributed charging operations is analyzed. This paper demonstrates that the distributed deployment using only 1-hop messaging achieves approximation of the centrally computed optimum, in terms of coverage and lifetime. [ABSTRACT FROM AUTHOR]

In this paper, we focus on large-scale environment monitoring by utilizing a fully decentralized team of mobile robots. The robots utilize the resource constrained-decentralized active sensing scheme to select the most informative (uncertain) locations to observe while conserving allocated resources (battery, travel distance, etc.). We utilize a distributed Gaussian process (GP) framework to split the computational load over our fleet of robots. Since each robot is individually generating a model of the environment, there may be conflicting predictions for test locations. Thus, in this paper, we propose an algorithm for aggregating individual prediction models into a single globally consistent model that can be used to infer the overall spatial dynamics of the environment. To make a prediction at a previously unobserved location, we propose a novel gating network for a mixture-of-experts model wherein the weight of an expert is determined by the responsibility of the expert over the unvisited location. The benefit of posing our problem as a centralized fusion with a distributed GP computation approach is that the robots never communicate with each other, individually optimize their own GP models based on their respective observations, and off-load all their learnt models on the base station only at the end of their respective mission times. We demonstrate the effectiveness of our approach using publicly available datasets. [ABSTRACT FROM AUTHOR]

This paper focuses on minimum-time path tracking, a subproblem in motion planning of robotic systems. We generate a time-optimal velocity profile for robotic manipulators taking into account kinematic and dynamic constraints. Based on the special structure of the constraints (called peaked constraints), profile generation is formulated as a linear programming (LP) problem. The LP-based control problem is solved by a sequential optimization method. The presented algorithm has reduced computational time compared to a general LP solver. [ABSTRACT FROM AUTHOR]

In this paper, we study two sensor assignment problems for multitarget tracking with the goal of improving the observability of the underlying estimator. We consider various measures of the observability matrix as the assignment value function. We first study the general version where the sensors must form teams to track individual targets. If the value function is monotonically increasing and submodular, then a greedy algorithm yields a $1/2$ –approximation. We then study a restricted version where exactly two sensors must be assigned to each target. We present a $1/3$ –approximation algorithm for this problem, which holds for arbitrary value functions (not necessarily submodular or monotone). In addition to approximation algorithms, we also present various properties of observability measures. We show that the inverse of the condition number of the observability matrix is neither monotone nor submodular, but present other measures that are. Specifically, we show that the trace and rank of the symmetric observability matrix are monotone and submodular and the log determinant of the symmetric observability matrix is monotone and submodular when the matrix is nonsingular. If the target's motion model is not known, the inverse cannot be computed exactly. Instead, we present a lower bound for distance sensors. In addition to theoretical results, we evaluate our results empirically through simulations. [ABSTRACT FROM AUTHOR]

An alternative approach to standard computed torque with feedback linearization is proposed in this paper to control cable-driven parallel robots (CDPRs) with highly flexible cables. Exteroceptive feedback is used to measure the end-effector Cartesian position at a high sampling rate. Stability is demonstrated using singular perturbation theory. The proposed control scheme is experimentally validated on a planar 3-degree-of-freedom CDPR and its efficiency is assessed by comparison with a simple kinematic control law. [ABSTRACT FROM AUTHOR]

This paper formally constructs navigation functions with time-varying destinations on star worlds. The construction is based on appropriate diffeomorphic transformations and extends an earlier sphere-world formulation. A new obstacle modeling method is also introduced, reducing analytical complexity and offering unified expressions of common classes of $n$ -dimensional obstacles. The method allows for dynamic target tracking and is validated through simulations and experiments. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of cooperative mapping (CM) using datasets collected by multiple users at different times, when the transformation between the users’ starting poses is unknown. Specifically, we formulate CM as a constrained optimization problem, in which each user's independently estimated trajectory and map are merged together by imposing geometric constraints between commonly observed point and line features. Additionally, we provide an algorithm for efficiently solving the CM problem, by taking advantage of its structure. The proposed solution is proven to be batch-least-squares (BLS) optimal over all users’ datasets, while it is less memory demanding and lends itself to parallel implementations. In particular, our solution is shown to be faster than the standard BLS solution, when the overlap between the users’ data is small. Furthermore, our algorithm is resource-aware as it is able to consistently trade accuracy for lower processing cost, by retaining only an informative subset of the common-feature constraints. Experimental results based on visual and inertial measurements collected from multiple users within large buildings are used to assess the performance of the proposed CM algorithm. [ABSTRACT FROM AUTHOR]

In this paper, visual servoing based on photometric moments is advocated. A direct approach is chosen by which the extraction of geometric primitives, visual tracking and image matching steps of a conventional visual servoing pipeline can be bypassed. A vital challenge in photometric methods is the change in the image resulting from the appearance and disappearance of portions of the scene from the camera field of view during the servo. To tackle this issue, a general model for the photometric moments enhanced with spatial weighting is proposed. The interaction matrix for these spatially weighted photometric moments is derived in an analytical form. The correctness of the modeling, effectiveness of the proposed strategy in handling the exogenous regions, and improved convergence domain are demonstrated with a combination of simulation and the experimental results. [ABSTRACT FROM AUTHOR]

In several multirobot applications in which communication is limited, the mission could require the robots to iteratively take coordinated joint decisions on how to spread out in the environment and on how to reconnect with each other to share data and compute plans. Exploration and surveillance are examples of these applications. In this paper, we consider the problem of computing robots’ paths on a graph-represented environment for restoring connections at minimum traveling cost. We call it the multirobot reconnection problem, we show its NP-hardness and hardness of approximation on some important classes of graphs, and we provide optimal and heuristic algorithms to solve it in practical settings. The techniques we propose are then exploited to derive a new efficient planning algorithm for a relevant connectivity-constrained multirobot planning problem addressed in the literature, the multirobot informative path planning with periodic connectivity problem. [ABSTRACT FROM AUTHOR]

This paper presents a method for controlling a swarm of quadrotors to perform agile interleaved maneuvers while holding a fixed relative formation, or transitioning between different formations. The method prevents collisions within the swarm, as well as between the quadrotors and static obstacles in the environment. The method is built upon the existing notion of a virtual structure, which serves as a framework with which to plan and execute complex interleaved trajectories, and also gives a simple, intuitive interface for a single human operator to control an arbitrarily large aerial swarm in real time. The virtual structure concept is integrated with differential flatness-based feedback control to give an end-to-end integrated swarm teleoperation system. Collision avoidance is achieved by using multiple layered potential fields. Our method is demonstrated in hardware experiments with groups of 3–5 quadrotors teleoperated by a single human operator, and simulations of 200 quadrotors teleoperated by a single human operator. [ABSTRACT FROM AUTHOR]

One camera and one low-cost inertial measurement unit (IMU) form a monocular visual-inertial system (VINS), which is the minimum sensor suite (in size, weight, and power) for the metric six degrees-of-freedom (DOF) state estimation. In this paper, we present VINS-Mono: a robust and versatile monocular visual-inertial state estimator. Our approach starts with a robust procedure for estimator initialization. A tightly coupled, nonlinear optimization-based method is used to obtain highly accurate visual-inertial odometry by fusing preintegrated IMU measurements and feature observations. A loop detection module, in combination with our tightly coupled formulation, enables relocalization with minimum computation. We additionally perform 4-DOF pose graph optimization to enforce the global consistency. Furthermore, the proposed system can reuse a map by saving and loading it in an efficient way. The current and previous maps can be merged together by the global pose graph optimization. We validate the performance of our system on public datasets and real-world experiments and compare against other state-of-the-art algorithms. We also perform an onboard closed-loop autonomous flight on the microaerial-vehicle platform and port the algorithm to an iOS-based demonstration. We highlight that the proposed work is a reliable, complete, and versatile system that is applicable for different applications that require high accuracy in localization. We open source our implementations for both PCs (https://github.com/HKUST-Aerial-Robotics/VINS-Mono) and iOS mobile devices (https://github.com/HKUST-Aerial-Robotics/VINS-Mobile). [ABSTRACT FROM AUTHOR]

In this paper, we propose and experimentally verify a distributed formation control algorithm for a group of multirotor unmanned aerial vehicles (UAVs). The algorithm brings the whole group of UAVs simultaneously to a prescribed submanifold that determines the formation shape in an asymptotically stable fashion in two- and three-dimensional environments. The complete distributed control framework is implemented with the combination of a fast model predictive control method executed at 50 Hz on low-power computers onboard multirotor UAVs and validated via a series of hardware-in-the-loop simulations and real-robot experiments. The experiments are configured to study the control performance in various formation cases of arbitrary time-varying (e.g., expanding, shrinking, or moving) shapes. In the actual experiments, up to four multirotors have been implemented to form arbitrary triangular, rectangular, and circular shapes drawn by the operator via a human–robot interaction device. We also carry out hardware-in-the-loop simulations using up to six onboard computers to achieve spherical formations and a formation moving through obstacles. [ABSTRACT FROM AUTHOR]

Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found, as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the problem but can be approximated with heuristics. This paper formally defines these sets of states and demonstrates how they can be used to analyze arbitrary planning problems. It uses the well-known $L^2$ norm (i.e., Euclidean distance) to analyze minimum-path-length problems and shows that existing approaches decrease in effectiveness factorially (i.e., faster than exponentially) with state dimension. It presents a method to address this curse of dimensionality by directly sampling the prolate hyperspheroids (i.e., symmetric $n$ -dimensional ellipses) that define the $L^2$ informed set. The importance of this direct informed sampling technique is demonstrated with Informed RRT*. This extension of RRT* has less theoretical dependence on state dimension and problem size than existing techniques and allows for linear convergence on some problems. It is shown experimentally to find better solutions faster than existing techniques on both abstract planning problems and HERB, a two-arm manipulation robot. [ABSTRACT FROM AUTHOR]

Whether robot controllers are manually designed or synthesized from high-level task specifications, assumptions about the environment need to be made, which can involve adversarial events or cooperative robots. In either case, if these assumptions are violated at runtime, the robot will fail to fulfill its task and will likely do something unexpected. In this paper, we focus on controllers synthesized from linear temporal logic. We tackle the problem of making these controllers robust against environment assumption violations that are common in robot execution. Our solution is a three-layer system: first, we propose an offline approach that accounts for transient violations such that the robot can still complete its task after temporary anomalies; the second layer is an online approach that automatically relaxes the environment assumptions to better capture environment behaviors and that allows the robot to react accordingly; and, finally, we automatically modify the actual environment behaviors, when possible, through negotiation with one of the environment robots operating in the workspace, such that our assumptions are met by the other robot and both robots accomplish their tasks. [ABSTRACT FROM AUTHOR]

This paper presents a computationally efficient method of generating state-to-state trajectories for fully actuated multirotor vehicles. The approach consists of computing translational and rotational motion primitives that guide the vehicle from any initial state, defined by position, velocity, and attitude, to any end state in a given time, and subsequently verifying the motion primitives’ feasibility. Computationally lightweight motion primitives for which closed-form solutions exist are presented and an efficient method to test their feasibility is derived. The algorithm is shown to be able to generate trajectories and verify their feasibility within a few microseconds and can thus be used as an implicit feedback law or in high-level path planners that involve evaluating a large number of possible trajectories to achieve some high-level goal. The algorithm's performance is analyzed by comparing it with time-optimal trajectories. An experimental demonstration that requires the computation of trajectories for a large set of end states in real time is used to evaluate the approach. [ABSTRACT FROM AUTHOR]

Extrinsic calibration is one of the most important problems in robotics, whose objective is to estimate the relative poses among the sensors and the robot. Currently, most on-line solutions of extrinsic calibration are based on the Gaussian filters, which estimate all the system states iteratively. However, a large number of the system states are not related to calibration. Estimating all these redundant states may highly increase the dimensionality of the problem, and therefore, undermine the calibration performance in both efficiency and robustness. In this paper, we propose an innovative on-line calibration algorithm, called constraint Gaussian filter with virtual measurements (VMCGF). The nature of VMCGF is a filter with a compact state vector containing only the states of interest, also called essential states. Violating the modeling principles of the traditional Gaussian filters, the measurements cannot be expressed by the observation function with the essential states solely. Exploiting the constraints between the measurements and the essential states, virtual measurements are generated according to the properties of the generalized chi-square distribution. Although originally developed to solve the calibration problem, VMCGF is a general filtering algorithm, that can be applied to solve other problems that might suffer from redundant states. The implementation of VMCGF on a camera odometry calibration problem is introduced, and its observability properties are analyzed. Both simulations and experiments are conducted to validate our algorithm. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm called \varepsilon ^\star , for online coverage path planning of unknown environment. The algorithm is built upon the concept of an Exploratory Turing Machine (ETM), which acts as a supervisor to the autonomous vehicle to guide it with adaptive navigation commands. The ETM generates a coverage path online using Multiscale Adaptive Potential Surfaces (MAPS), which are hierarchically structured and dynamically updated based on sensor information. The \varepsilon ^\star -algorithm is computationally efficient, guarantees complete coverage, and does not suffer from the local extrema problem. Its performance is validated by 1) high-fidelity simulations on Player/Stage and 2) actual experiments in a laboratory setting on autonomous vehicles. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of detecting intruders in complex bidimensional environments with a team of robots arranged in line formations called sweep lines. Sweep lines are used to coordinate the motion of multiple robots and guarantee the detection of any number of arbitrarily fast intruders, even when each robot has a limited sensor footprint. We present a formalization of the problem, coined Line-Clear, which requires the computation of sweep schedules to coordinate the motion of multiple sweep lines using the fewest robots possible. We provide a proof of NP-hardness of the general Line-Clear problem based on results from graph searching. An algorithm to compute sweep schedules for simply connected environments, which additionally guarantees that the cleared area is connected and not recontaminated, is then presented. We analyze its complexity formally and in simulation experiments and present solutions for a number of subproblems required for an implementation of the algorithm. The analysis provides a formal criterion for when the algorithm runs in polynomial time and the experiments indicate that this criterion may be satisfied for most environments in practice. [ABSTRACT FROM AUTHOR]

This paper discusses the nonholonomic robotic systems whose motion constraints assume the Pfaffian form, and the equations of motion are represented by driftless control systems with outputs. By reference to the end point map of such a control system, we define the system's Jacobian and study Jacobian motion-planning algorithms. A new Lagrange-type Jacobian inverse, referred to as the General Lagrangian Jacobian Inverse (GLJI), is designed as the solution of an optimal control problem with a Lagrange-type objective function. Singularities of GLJI are examined. A special choice of the objective function illustrates features of GLJI. A new motion-planning algorithm based on GLJI is proposed. Theoretical arguments are illustrated with a motion-planning problem of a space robot. [ABSTRACT FROM PUBLISHER]

This paper presents a framework for multirobot motion planning that characterizes pairwise interactions between agents, e.g., crossing paths while en route to a destination. Mixing is identified as the number of pairwise crossings exhibited by the robot motion. Mixing patterns specified through elements of the braid group provide sufficient level of abstraction to describe interactions without concern for the geometry of the motion. Controllers are constructed explicitly reasoning about the spatial collocation of robots to execute mixing patterns, achieving rich motion in a shared space, e.g., to exchange inter-robot information. We do not focus on achieving a particular pattern, but rather on the problem of being able to execute a whole class of them (e.g., all patterns with at most $M$ pairwise interactions). The result is a hybrid system driven by symbolic inputs that are mapped onto paths, realizing desired mixing levels. Controllers derived from optimal control provide theoretical bounds on the achievable amount of mixing, satisfaction of spatio-temporal constraints, and collision-free trajectories. Designs are carried to implementation on real robot platforms. [ABSTRACT FROM PUBLISHER]

This paper presents a novel control algorithm to regulate the aerodynamic thrust produced by fixed-pitch rotors commonly used on small-scale electrically powered multirotor aerial vehicles. The proposed controller significantly improves the disturbance rejection and gust tolerance of rotor thrust control compared to state-of-the-art RPM (revolutions per minute) rotor control schemes. The thrust modeling approach taken is based on a model of aerodynamic power generated by a fixed-pitch rotor and computed in real time on the embedded electronic speed controllers using measurements of electrical power and rotor angular velocity. Static and dynamic flight tests were carried out in downdrafts and updrafts of varying strengths to quantify the resulting improvement in maintaining a desired thrust setpoint. The performance of the proposed approach in flight conditions is demonstrated by a path tracking experiment, where a quadrotor was flown through an artificial wind gust and the trajectory tracking error was measured. The proposed approach for thrust control demonstrably reduced the tracking error compared to classical RPM rotor control. [ABSTRACT FROM PUBLISHER]

This paper considers the problem of planning trajectories for both single and multiple sensing robots to best estimate a spatiotemporal field in a dynamic environment. The robots use a Kalman filter to maintain an estimate of the field value and to compute the error covariance matrix of the estimate. Two new sampling-based path-planning algorithms (rapidly expanding random cycles and an improved variant of rapidly expanding random cycles) are proposed to find periodic trajectories for the sensing robots that minimize the largest eigenvalue of the error covariance matrix over an infinite horizon. The algorithms are proven to find the minimum infinite horizon cost cycle in a random graph, which grows by successively adding random points. The algorithms leverage recently developed methods for periodic Riccati recursions to efficiently compute the infinite horizon cost of the cycles, and they use the monotonicity property of the Riccati recursion to efficiently compare the costs of different cycles without explicitly computing their costs. The algorithms are demonstrated in a study using National Oceanic and Atmospheric Administration data to plan sensing trajectories in the Caribbean Sea. Our algorithms significantly outperform random, greedy, and receding horizon approaches in this environment. [ABSTRACT FROM AUTHOR]

We study optimal multirobot path planning on graphs (\textMPP ) over four minimization objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance, the total arrival time, and the total distance. Having established previously that these objectives are distinct and NP-hard to optimize, in this paper, we focus on efficient algorithmic solutions for solving these optimal \textMPP problems. Toward this goal, we first establish a one-to-one solution mapping between \textMPP and a special type of multiflow network. Based on this equivalence and integer linear programming (ILP), we design novel and complete algorithms for optimizing over each of the four objectives. In particular, our exact algorithm for computing optimal makespan solutions is a first that is capable of solving extremely challenging problems with robot-vertex ratios as high as $100\%$ . Then, we further improve the computational performance of these exact algorithms through the introduction of principled heuristics, at the expense of slight optimality loss. The combination of ILP model based algorithms and the heuristics proves to be highly effective, allowing the computation of $1.x$-optimal solutions for problems containing hundreds of robots, densely populated in the environment, often in just seconds. [ABSTRACT FROM AUTHOR]

In this paper, we present a fully distributed solution to drive a team of robots to reach a desired formation in the absence of an external positioning system that localizes them. Our solution addresses two fundamental problems that appear in this context. First, we propose a 3-D distributed control law, designed at a kinematic level, that uses two simultaneous consensus controllers: one to control the relative orientations between robots, and another for the relative positions. The convergence to the desired configuration is shown by comparing the system with time-varying orientations against the equivalent approach with fixed orientations, showing that their difference vanishes as time goes to infinity. Second, in order to apply this controller to a group of aerial robots, we combine this idea with a novel sensor fusion algorithm to estimate the relative pose of the robots by using onboard cameras and information from the inertial measurement unit. The algorithm removes the influence of roll and pitch from the camera images and estimates the relative pose between robots by using a structure from the motion approach. Simulation results, as well as hardware experiments with a team of three quadrotors, demonstrate the effectiveness of the controller and the vision system working together. [ABSTRACT FROM PUBLISHER]

In this paper, we present a new feedback method to automatically servo-control the 3-D shape of soft objects with robotic manipulators. The soft object manipulation problem has recently received a great deal of attention from robotics researchers because of its potential applications in, e.g., food industry, home robots, medical robotics, and manufacturing. A major complication to automatically control the shape of an object is the estimation of its deformation properties, which determines how the manipulator's motion actively transforms into deformations. Note that these properties are rarely known beforehand, and its offline parametric identification is difficult and/or impractical to conduct in many applications. To cope with this issue, we developed a new algorithm that computes in real time the unknown deformation parameters of a soft object; this algorithm provides a valuable adaptive behavior to the deformation controller, something we cannot achieve with traditional fixed-model approaches. In contrast with most controllers in the literature, our new method can explicitly servo-control 3-D deformations (and not just 2-D image projections) in an entirely model-free way. To validate the proposed adaptive controller, we present a detailed experimental study with robotic manipulators. [ABSTRACT FROM PUBLISHER]

This paper describes a new vision-based control method to drive a set of robots moving on the ground plane to a desired formation. As the main contribution, we propose to use multiple camera-equipped unmanned aerial vehicles (UAVs) as control units. Each camera views, and is used to control, a subset of the ground team. Thus, the method is partially distributed, combining the simplicity of centralized schemes with the scalability and robustness of distributed strategies. Relying on a homography computed for each UAV-mounted camera, our approach is purely image-based and has low computational cost. In the control strategy we propose, if a robot is seen by multiple cameras, it computes its motion by combining the commands it receives. Then, if the intersections between the sets of robots viewed by the different cameras satisfy certain conditions, we formally guarantee the stabilization of the formation, considering unicycle robots. We also propose a distributed algorithm to control the camera motions that preserves these required overlaps, using communications. The effectiveness of the presented control scheme is illustrated via simulations and experiments with real robots. [ABSTRACT FROM PUBLISHER]

This paper presents algorithms to compute the generalized distance between two separated or penetrating compact convex sets, which is defined as the minimum or maximum scale factor of a given gauge set such that the scaled gauge set intersects or is contained in the Minkowski difference of the two sets. The traditional Euclidean distance is a special case where the origin-centered unit ball is used as the gauge set. While the generalized distance was proposed almost a decade ago, the only practical method for its computation has been general-purpose numerical optimization, which is computationally expensive. In contrast, our geometry-based algorithms are efficient and guarantee globally optimal solutions. Important applications of the algorithms in robotics include collision detection and grasp planning. The algorithm for computing the penetration distance also provides an accurate and efficient approach to flatness error evaluation, which is a fundamental problem in manufacturing. We demonstrate that our algorithms possess superior efficiency and accuracy in these applications. [ABSTRACT FROM PUBLISHER]

One of the central problems in computer vision is the detection of semantically important objects and the estimation of their pose. Most of the work in object detection has been based on single image processing, and its performance is limited by occlusions and ambiguity in appearance and geometry. This paper proposes an active approach to object detection in which the point of view of a mobile depth camera is controlled. When an initial static detection phase identifies an object of interest, several hypotheses are made about its class and orientation. Then, a sequence of views, which balances the amount of energy used to move the sensor with the chance of identifying the correct hypothesis, is planned. We formulate an active hypothesis testing problem, which includes sensor mobility, and solve it using a point-based approximate partially observable Markov decision process algorithm. The validity of our approach is verified through simulation and real-world experiments with the PR2 robot. The results suggest that the approach outperforms the widely used greedy viewpoint selection and provides a significant improvement over static object detection. [ABSTRACT FROM AUTHOR]