Searcharxiv⌕ Search

arXiv subjects

Robotics

Explore arXiv robotics papers and cs.RO metadata. Search for robot learning, motion planning and control, then check experiments in the source manuscript.

At least 1,495 records · Page 83Linked to original sources

A Survey of Research on Control of Teams of Small Robots in Military Operations

While a number of excellent review articles on military robots have appeared in existing literature, this paper focuses on a distinct sub-space of related problems: small military robots organized into moderately sized squads, operating in a ground combat environment. Specifically, we consider the following: - Command of practical small robots, comparable to current generation, small unmanned ground vehicles (e.g., PackBots) with limited computing and sensor payload, as opposed to larger vehicle-sized robots or micro-scale robots; - Utilization of moderately sized practical forces of 3-10 robots applicable to currently envisioned military ground operations; - Complex three-dimensional physical environments, such as urban areas or mountainous terrains and the inherent difficulties they impose, including limited and variable fields of observation, difficult navigation, and intermittent communication; - Adversarial environments where the active, intelligent enemy is the key consideration in determining the behavior of the robotic force; and - Purposeful, partly autonomous, coordinated behaviors that are necessary for such a robotic force to survive and complete missions; these are far more complex than, for example, formation control or field coverage behavior.

cs.RO↗

Physical extracurricular activities in educational child-robot interaction

In an exploratory study on educational child-robot interaction we investigate the effect of alternating a learning activity with an additional shared activity. Our aim is to enhance and enrich the relationship between child and robot by introducing "physical extracurricular activities". This enriched relationship might ultimately influence the way the child and robot interact with the learning material. We use qualitative measurement techniques to evaluate the effect of the additional activity on the child-robot relationship. We also explore how these metrics can be integrated in a highly exploratory cumulative score for the relationship between child and robot. This cumulative score suggests a difference in the overall child-robot relationship between children who engage in a physical extracurricular activity with the robot, and children who only engage in the learning activity with the robot.

cs.RO↗

An approach of IR-Based short-range correspondence systems for swarm robot balanced requisitions and communications

This paper exhibits a short-run correspondence method appropriate for swarm versatile robots application. Infrared is utilized for transmitting and accepting information and obstruction location. The infrared correspondence code based swarm signaling is utilized for an independent versatile robot communication system in this research. A code based signaling system is developed for transmitting information between different entities of robot. The reflected infrared sign is additionally utilized for separation estimation for obstruction evasion. Investigation of robot demonstrates the possibility of utilizing infrared signs to get a solid nearby correspondence between swarm portable robots. This paper exhibits a basic decentralized control for swarm of self-collecting robots. Every robot in the code based swarm signaling is completely self-governing and controlled utilizing a conduct based methodology with just infrared-based nearby detecting and correspondences. The viability of the methodology has been checked with simulation, for a set of swarm robots.

cs.RO↗

Cuspidal Robots

This chapter is dedicated to the so-called cuspidal robots, i.e. those robots that can move from one inverse geometric solution to another without meeting a singular confuguration. This feature was discovered quite recently and has then been fascinating a lot of researchers. After a brief history of cuspidal robots, the chapter provides the main features of cuspidal robots: explanation of the non-singular change of posture, uniqueness domains, regions of feasible paths, identification and classification of cuspidal robots. The chapter focuses on 3-R orthogonal serial robots. The case of 6-dof robots and parallel robots is discussed in the end of this chapter.

cs.RO↗

A review on cloud robotics based frameworks to solve simultaneous localization and mapping (slam) problem

Cloud Robotics is one of the emerging area of robotics. It has created a lot of attention due to its direct practical implications on Robotics. In Cloud Robotics, the concept of cloud computing is used to offload computational extensive jobs of the robots to the cloud. Apart from this, additional functionalities can also be offered on run to the robots on demand. Simultaneous Localization and Mapping (SLAM) is one of the computational intensive algorithm in robotics used by robots for navigation and map building in an unknown environment. Several Cloud based frameworks are proposed specifically to address the problem of SLAM, DAvinCi, Rapyuta and C2TAM are some of those framework. In this paper, we presented a detailed review of all these framework implementation for SLAM problem.

cs.RO↗

Design of Stochastic Robotic Swarms for Target Performance Metrics in Boundary Coverage Tasks

In this work, we analyze \textit{stochastic coverage schemes} (SCS) for robotic swarms in which the robots randomly attach to a one-dimensional boundary of interest using local communication and sensing, without relying on global position information or a map of the environment. Robotic swarms may be required to perform boundary coverage in a variety of applications, including environmental monitoring, collective transport, disaster response, and nanomedicine. We present a novel analytical approach to computing and designing the statistical properties of the communication and sensing networks that are formed by random robot configurations on a boundary. We are particularly interested in the event that a robot configuration forms a connected communication network or maintains continuous sensor coverage of the boundary. Using tools from order statistics, random geometric graphs, and computational geometry, we derive formulas for properties of the random graphs generated by robots that are independently and identically distributed along a boundary. We also develop order-of-magnitude estimates of these properties based on Poisson approximations and threshold functions. For cases where the SCS generates a uniform distribution of robots along the boundary, we apply our analytical results to develop a procedure for computing the robot population size, diameter, sensing range, or communication range that yields a random communication network or sensor network with desired properties.

cs.RO↗

An opportunistic linear-convex algorithm for localization in mobile robot networks

In this paper, we develop a \textcolor{black}{\emph{distributed}} algorithm to localize a network of robots moving arbitrarily in a bounded region. In the case of such mobile networks, the main challenge is that the robots may not be able to find nearby robots to implement a distributed algorithm. We address this issue by providing an opportunistic algorithm that only implements a location update when there are nearby robots and does not update otherwise. We assume that each robot measures a noisy version of its motion and the distances to the nearby robots. To localize a network of mobile robots in~$\mathbb{R}^m$, we provide a simple \emph{linear} update, which is based on barycentric coordinates and is linear-convex. We abstract the corresponding localization algorithm as a Linear Time-Varying (LTV) system and show that it asymptotically converges to the true locations~of~the robots. We first focus on the noiseless case, where the distance and motion vectors are known (measured) perfectly, and provide sufficient conditions on the convergence of the algorithm. We then evaluate the performance of the algorithm in the presence of noise and provide modifications to counter the undesirable effects of noise. \textcolor{black}{We further show that our algorithm precisely tracks a mobile network as long as there is at least one known beacon (a node whose location is perfectly known).

cs.RO↗

Temporal Logic Task Planning and Intermittent Connectivity Control of Mobile Robot Networks

In this paper, we develop a distributed intermittent communication and task planning framework for mobile robot teams. The goal of the robots is to accomplish complex tasks, captured by local Linear Temporal Logic formulas, and share the collected information with all other robots and possibly also with a user. Specifically, we consider situations where the robot communication capabilities are not sufficient to form reliable and connected networks while the robots move to accomplish their tasks. In this case, intermittent communication protocols are necessary that allow the robots to temporarily disconnect from the network in order to accomplish their tasks free of communication constraints. We assume that the robots can only communicate with each other when they meet at common locations in space. Our distributed control framework jointly determines local plans that allow all robots fulfill their assigned temporal tasks, sequences of communication events that guarantee information exchange infinitely often, and optimal communication locations that minimize a desired distance metric. Simulation results verify the efficacy of the proposed controllers.

cs.RO↗

Scalable Asymptotically-Optimal Multi-Robot Motion Planning

Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of all of the robots in the space. The dimensionality of this space increases with the number of robots, rendering this approach impractical. This work focuses on a scalable sampling-based planner for coupled multi-robot problems that provides asymptotic optimality. It extends the dRRT approach, which proposed building roadmaps for each robot and searching an implicit roadmap in the composite configuration space. This work presents a new method, dRRT* , and develops theory for scalable convergence to optimal paths in multi-robot problems. Simulated experiments indicate dRRT* converges to high-quality paths while scaling to higher numbers of robots where the naive approach fails. Furthermore, dRRT* is applicable to high-dimensional problems, such as planning for robot manipulators

cs.MA↗

Node Primitives: an open end-user programming platform for social robots

With the expected adoption of robots able to seamlessly and intuitively interact with people in real-world scenarios, the need arises to provide non-technically-skilled users with easy-to-understand paradigms for customising robot behaviors. In this paper, we present an interaction design robot programming platform for enabling multidisciplinary social robot research and applications. This platform is referred to Node Primitives (NEP) and consists of two main parts. On the one hand, a ZeroMQ and Python-based distributed software framework has been developed to provide inter-process communication and robot behavior specification mechanisms. On the other hand, a web-based end-user programming (EUP) interface has been developed to allow for an easy and intuitive way of programming and executing robot behaviors. In order to evaluate NEP, we discuss the development of a human-robot interaction application using arm gestures to control robot behaviors. A usability test for the proposed EUP interface is also presented.

cs.RO↗

Intelligent Collision Management in Dynamic Environments for Human-Centered Robots

In this context, a major focus of this thesis is on unintentional collisions, where a straight goal is to eliminate injury from users and passerby's via realtime sensing and control systems. A less obvious focus is to combine collision response with tools from motion planning in order to produce intelligent safety behaviors that ensure the safety of multiple people or objects. Yet, an even more challenging problem is to anticipate future collisions between objects external to the robot and have the robot intervene to prevent imminent accidents. In this dissertation, we study all of these sophisticated flavors of collision reaction and intervention. We investigate in-depth multiple key and interesting topics related to collisions and safety of mobile robots and robotic manipulators operating in human environments. Overall we deeply investigate collisions from many perspectives and develop techniques that borrow and contribute to the areas of mechatronic design, sensor processing, feedback controls, motion planning, and probabilistic reasoning methods. The result of this study is a set of key experiments and guidelines to deal with collisions in mobile robots and robotic manipulators. This study aims at influencing future studies on field operations of robots and accelerate the employment of advanced robots in our daily environments without compromising our safety.

cs.RO↗

Trust-Aware Decision Making for Human-Robot Collaboration: Model Learning and Planning

Trust in autonomy is essential for effective human-robot collaboration and user adoption of autonomous systems such as robot assistants. This paper introduces a computational model which integrates trust into robot decision-making. Specifically, we learn from data a partially observable Markov decision process (POMDP) with human trust as a latent variable. The trust-POMDP model provides a principled approach for the robot to (i) infer the trust of a human teammate through interaction, (ii) reason about the effect of its own actions on human trust, and (iii) choose actions that maximize team performance over the long term. We validated the model through human subject experiments on a table-clearing task in simulation (201 participants) and with a real robot (20 participants). In our studies, the robot builds human trust by manipulating low-risk objects first. Interestingly, the robot sometimes fails intentionally in order to modulate human trust and achieve the best team performance. These results show that the trust-POMDP calibrates trust to improve human-robot team performance over the long term. Further, they highlight that maximizing trust alone does not always lead to the best performance.

cs.RO↗

Pedestrian-Robot Interaction Experiments in an Exit Corridor

The study of human-robot interaction (HRI) has received increasing research attention for robot navigation in pedestrian crowds. In this paper, we present empirical study of pedestrian-robot interaction in an uni-directional exit corridor. We deploy a mobile robot moving in a direction perpendicular to that of the pedestrian flow, and install a pedestrian motion tracking system to record the collective motion. We analyze both individual and collective motion of pedestrians, and measure the effect of the robot motion on the overall pedestrian flow. The experimental results show the effect of passive HRI, where the pedestrians' overall speed is slowed down in the presence of the robot, and the faster the robot moves, the lower the average pedestrian velocity becomes. Experiment results show qualitative consistency of the collective HRI effect with simulation results that was previously reported. The study can be used to guide future design of robot-assisted pedestrian evacuation algorithms.

cs.RO↗

SCALAR - Simultaneous Calibration of 2D Laser and Robot's Kinematic Parameters Using Three Planar Constraints

Industrial robots are increasingly used in various applications where the robot accuracy becomes very important, hence calibrations of the robot's kinematic parameters and the measurement system's extrinsic parameters are required. However, the existing calibration approaches are either too cumbersome or require another expensive external measurement system such as laser tracker or measurement spinarm. In this paper, we propose SCALAR, a calibration method to simultaneously improve the kinematic parameters of a 6-DoF robot and the extrinsic parameters of a 2D Laser Range Finder (LRF) which is attached to the robot. Three flat planes are placed around the robot, and for each plane the robot moves to several poses such that the LRF's ray intersect the respective plane. Geometric planar constraints are then used to optimize the calibration parameters using Levenberg- Marquardt nonlinear optimization algorithm. We demonstrate through simulations that SCALAR can reduce the average position and orientation errors of the robot system from 14.6mm and 4.05 degrees to 0.09mm and 0.02 degrees.

cs.RO↗

Smartphone-based Home Robotics

Humanoid robotics is a promising field because the strong human preference to interact with anthropomorphic interfaces. Despite this, humanoid robots are far from reaching main stream adoption and the features available in such robots seem to lag that of the latest smartphones. A fragmented robot ecosystem and low incentives to developers do not help to foster the creation of Robot-Apps either. In contrast, smartphones enjoy high adoption rates and a vibrant app ecosystem (4M apps published). Given this, it seems logical to apply the mobile SW and HW development model to humanoid robots. One way is to use a smartphone to power the robot. Smartphones have been embedded in toys and drones before. However, they have never been used as the main compute unit in a humanoid embodiment. Here, we introduce a novel robot architecture based on smartphones that demonstrates x3 cost reduction and that is compatible with iOS/Android.

cs.RO↗

Development of a Steel Bridge Climbing Robot

Motivated by a high demand for automated inspection of civil infrastructure, this work presents a new design and development of a tank-like robot for structural health monitoring. Unlike most existing magnetic wheeled mobile robot designs, which may be suitable for climbing on flat steel surface, our proposed tank-like robot design uses reciprocating mechanism and roller-chains to make it capable of climbing on different structural shapes (e.g., cylinder, cube) with coated or non-coated steel surfaces. The proposed robot is able to transition from one surface to the other (e.g., from flat surface to curving surface). Taking into account of several strict considerations (including tight dimension, efficient adhesion and climbing flexibility) to adapt with various shapes of steel structures, a prototype tank-like robot incorporating multiple sensors (hall-effects, sonars, inertial measurement unit and camera), has been developed. Rigorous analysis of robot kinematics, adhesion force, sliding failure and turn-over failure has been conducted to demonstrate the stability of the proposed design. Mechanical and magnetic force analysis together with sliding/turn-over failure investigation can serve as an useful framework for designing various steel climbing robots in the future. Experimental results and field deployments confirm the adhesion and climbing capability of the developed robot.

cs.RO↗

Resilient Active Information Gathering with Mobile Robots

Applications of safety, security, and rescue in robotics, such as multi-robot target tracking, involve the execution of information acquisition tasks by teams of mobile robots. However, in failure-prone or adversarial environments, robots get attacked, their communication channels get jammed, and their sensors may fail, resulting in the withdrawal of robots from the collective task, and consequently the inability of the remaining active robots to coordinate with each other. As a result, traditional design paradigms become insufficient and, in contrast, resilient designs against system-wide failures and attacks become important. In general, resilient design problems are hard, and even though they often involve objective functions that are monotone or submodular, scalable approximation algorithms for their solution have been hitherto unknown. In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them; system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures; and provable approximation performance, i.e., the algorithm ensures for all monotone (and not necessarily submodular) objective functions a solution that is finitely close to the optimal. We quantify our algorithm's approximation performance using a notion of curvature for monotone set functions. We support our theoretical analyses with simulated and real-world experiments, by considering an active information gathering scenario, namely, multi-robot target tracking.

cs.RO↗

Effects of Interruptibility-Aware Robot Behavior

As robots become increasingly prevalent in human environments, there will inevitably be times when a robot needs to interrupt a human to initiate an interaction. Our work introduces the first interruptibility-aware mobile robot system, and evaluates the effects of interruptibility-awareness on human task performance, robot task performance, and on human interpretation of the robot's social aptitude. Our results show that our robot is effective at predicting interruptibility at high accuracy, allowing it to interrupt at more appropriate times. Results of a large-scale user study show that while participants are able to maintain task performance even in the presence of interruptions, interruptibility-awareness improves the robot's task performance and improves participant social perception of the robot.

cs.RO↗