Pub Date : 2015-07-01DOI: 10.15607/RSS.2015.XI.032
Shervin Javdani, Siddhartha S Srinivasa, J Andrew Bagnell
In shared autonomy, user input and robot autonomy are combined to control a robot to achieve a goal. Often, the robot does not know a priori which goal the user wants to achieve, and must both predict the user's intended goal, and assist in achieving that goal. We formulate the problem of shared autonomy as a Partially Observable Markov Decision Process with uncertainty over the user's goal. We utilize maximum entropy inverse optimal control to estimate a distribution over the user's goal based on the history of inputs. Ideally, the robot assists the user by solving for an action which minimizes the expected cost-to-go for the (unknown) goal. As solving the POMDP to select the optimal action is intractable, we use hindsight optimization to approximate the solution. In a user study, we compare our method to a standard predict-then-blend approach. We find that our method enables users to accomplish tasks more quickly while utilizing less input. However, when asked to rate each system, users were mixed in their assessment, citing a tradeoff between maintaining control authority and accomplishing tasks quickly.
{"title":"Shared Autonomy via Hindsight Optimization.","authors":"Shervin Javdani, Siddhartha S Srinivasa, J Andrew Bagnell","doi":"10.15607/RSS.2015.XI.032","DOIUrl":"10.15607/RSS.2015.XI.032","url":null,"abstract":"<p><p>In <i>shared autonomy</i>, user input and robot autonomy are combined to control a robot to achieve a goal. Often, the robot does not know a priori which goal the user wants to achieve, and must both predict the user's intended goal, and assist in achieving that goal. We formulate the problem of shared autonomy as a Partially Observable Markov Decision Process with uncertainty over the user's goal. We utilize maximum entropy inverse optimal control to estimate a distribution over the user's goal based on the history of inputs. Ideally, the robot assists the user by solving for an action which minimizes the expected cost-to-go for the (unknown) goal. As solving the POMDP to select the optimal action is intractable, we use hindsight optimization to approximate the solution. In a user study, we compare our method to a standard predict-then-blend approach. We find that our method enables users to accomplish tasks more quickly while utilizing less input. However, when asked to rate each system, users were mixed in their assessment, citing a tradeoff between maintaining control authority and accomplishing tasks quickly.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"2015 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6329599/pdf/nihms801800.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36858416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-09DOI: 10.15607/RSS.2012.VIII.058
C. Yoo, R. Fitch, S. Sukkarieh
Temporal logic and model-checking are useful theoretical tools for specifying complex goals at the task level and formally verifying the performance of control policies. We are interested in tasks that involve constraints on real-valued energy resources. In particular, autonomous gliding aircraft gain energy in the form of altitude by exploiting wind currents and must maintain altitude within some range during motion planning. We propose an extension to probabilistic computation tree logic that expresses such real-valued resource threshold constraints, and present model-checking algorithms that evaluate a piecewise control policy with respect to a formal specification and hard or soft performance guarantees. We validate this approach through simulated examples of motion planning among obstacles for an autonomous thermal glider. Our results demonstrate probabilistic performance guarantees on the ability of the glider to complete its task, following a given piecewise control policy, without knowing the exact path of the glider in advance.
{"title":"Probabilistic Temporal Logic for Motion Planning with Resource Threshold Constraints","authors":"C. Yoo, R. Fitch, S. Sukkarieh","doi":"10.15607/RSS.2012.VIII.058","DOIUrl":"https://doi.org/10.15607/RSS.2012.VIII.058","url":null,"abstract":"Temporal logic and model-checking are useful theoretical tools for specifying complex goals at the task level and formally verifying the performance of control policies. We are interested in tasks that involve constraints on real-valued energy resources. In particular, autonomous gliding aircraft gain energy in the form of altitude by exploiting wind currents and must maintain altitude within some range during motion planning. We propose an extension to probabilistic computation tree logic that expresses such real-valued resource threshold constraints, and present model-checking algorithms that evaluate a piecewise control policy with respect to a formal specification and hard or soft performance guarantees. We validate this approach through simulated examples of motion planning among obstacles for an autonomous thermal glider. Our results demonstrate probabilistic performance guarantees on the ability of the glider to complete its task, following a given piecewise control policy, without knowing the exact path of the glider in advance.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91396207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-09DOI: 10.15607/RSS.2012.VIII.030
Y. Latif, C. C. Lerma, José Neira
Long term autonomy in robots requires the ability to reconsider previously taken decisions when new evidence becomes available. Loop closing links generated by a place recognition system may become inconsistent as additional evidence arrives. This paper is concerned with the detection and exclusion of such contradictory information from the map being built, in order to recover the correct map estimate. We propose a novel consistency based method to extract the loop closure regions that agree both among themselves and with the robot trajectory over time. We also assume that the contradictory loop closures are inconsistent among themselves and with the robot trajectory. We support our proposal, the RRR algorithm, on well-known odometry systems, e.g. visual or laser, using the very efficient graph optimization framework g2o as back-end. We back our claims with several experiments carried out on real data.
{"title":"Robust Loop Closing Over Time","authors":"Y. Latif, C. C. Lerma, José Neira","doi":"10.15607/RSS.2012.VIII.030","DOIUrl":"https://doi.org/10.15607/RSS.2012.VIII.030","url":null,"abstract":"Long term autonomy in robots requires the ability to reconsider previously taken decisions when new evidence becomes available. Loop closing links generated by a place recognition system may become inconsistent as additional evidence arrives. This paper is concerned with the detection and exclusion of such contradictory information from the map being built, in order to recover the correct map estimate. We propose a novel consistency based method to extract the loop closure regions that agree both among themselves and with the robot trajectory over time. We also assume that the contradictory loop closures are inconsistent among themselves and with the robot trajectory. We support our proposal, the RRR algorithm, on well-known odometry systems, e.g. visual or laser, using the very efficient graph optimization framework g2o as back-end. We back our claims with several experiments carried out on real data.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-09DOI: 10.15607/RSS.2012.VIII.050
L. Sentis, Josh Petersen, Roland Philippsen
We investigate controllers for mobile humanoid robots that maneuver in irregular terrains while performing accurate physical interactions with the environment and with human operators and test them on Dreamer, our new robot with a humanoid upper body (torso, arm, head) and a holonomic mobile base (triangularly arranged Omni wheels). All its actuators are torque controlled, and the upper body provides redundant degrees of freedom. We developed new dynamical models and created controllers that stabilize the robot in the presence of slope variations, while it compliantly interacts with humans.This paper considers underactuated free-body dynamics with contact constraints between the wheels and the terrain. Moreover, Dreamer incorporates a biarticular mechanical transmission that we model as a force constraint. Using these tools, we develop new compliant multiobjective skills and include self-motion stabilization for the highly redundant robot.
{"title":"Experiments with Balancing on Irregular Terrains using the Dreamer Mobile Humanoid Robot","authors":"L. Sentis, Josh Petersen, Roland Philippsen","doi":"10.15607/RSS.2012.VIII.050","DOIUrl":"https://doi.org/10.15607/RSS.2012.VIII.050","url":null,"abstract":"We investigate controllers for mobile humanoid robots that maneuver in irregular terrains while performing accurate physical interactions with the environment and with human operators and test them on Dreamer, our new robot with a humanoid upper body (torso, arm, head) and a holonomic mobile base (triangularly arranged Omni wheels). All its actuators are torque controlled, and the upper body provides redundant degrees of freedom. We developed new dynamical models and created controllers that stabilize the robot in the presence of slope variations, while it compliantly interacts with humans.This paper considers underactuated free-body dynamics with contact constraints between the wheels and the terrain. Moreover, Dreamer incorporates a biarticular mechanical transmission that we model as a force constraint. Using these tools, we develop new compliant multiobjective skills and include self-motion stabilization for the highly redundant robot.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"68 1","pages":"393-400"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91395632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-09DOI: 10.15607/RSS.2012.VIII.032
Sejoon Lim, Christian Sommer, E. Nikolova, D. Rus
We describe an algorithm for stochastic path planning and applications to route planning in the presence of traffic delays. We improve on the prior state of the art by designing, analyzing, implementing, and evaluating data structures that answer approximate stochastic shortest-path queries. For example, our data structures can be used to efficiently compute paths that maximize the probability of arriving at a destination before a given time deadline. Our main theoretical result is an algorithm that, given a directed planar network with edge lengths characterized by expected travel time and variance, pre-computes a data structure in quasi-linear time such that approximate stochastic shortestpath queries can be answered in poly-logarithmic time (actual worst-case bounds depend on the probabilistic model). Our main experimental results are two-fold: (i) we provide methods to extract travel-time distributions from a large set of heterogenous GPS traces and we build a stochastic model of an entire city, and (ii) we adapt our algorithms to work for realworld road networks, we provide an efficient implementation, and we evaluate the performance of our method for the model of the aforementioned city.
{"title":"Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries","authors":"Sejoon Lim, Christian Sommer, E. Nikolova, D. Rus","doi":"10.15607/RSS.2012.VIII.032","DOIUrl":"https://doi.org/10.15607/RSS.2012.VIII.032","url":null,"abstract":"We describe an algorithm for stochastic path planning and applications to route planning in the presence of traffic delays. We improve on the prior state of the art by designing, analyzing, implementing, and evaluating data structures that answer approximate stochastic shortest-path queries. For example, our data structures can be used to efficiently compute paths that maximize the probability of arriving at a destination before a given time deadline. Our main theoretical result is an algorithm that, given a directed planar network with edge lengths characterized by expected travel time and variance, pre-computes a data structure in quasi-linear time such that approximate stochastic shortestpath queries can be answered in poly-logarithmic time (actual worst-case bounds depend on the probabilistic model). Our main experimental results are two-fold: (i) we provide methods to extract travel-time distributions from a large set of heterogenous GPS traces and we build a stochastic model of an entire city, and (ii) we adapt our algorithms to work for realworld road networks, we provide an efficient implementation, and we evaluate the performance of our method for the model of the aforementioned city.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"52 1","pages":"249-256"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-06-01DOI: 10.15607/rss.2011.vii.033
Sachin Patil, Jur van den, Berg Ron Alterovitz
Many tasks in robot-assisted surgery, food handling, manufacturing, and other applications require planning and controlling the motions of manipulators or other devices that must interact with highly deformable objects. We present a unified approach for motion planning under uncertainty in deformable environments that maximizes probability of success by accounting for uncertainty in deformation models, noisy sensing, and unpredictable actuation. Unlike prior planners that assume deterministic deformations or treat deformations as a type of small perturbation, our method explicitly considers the uncertainty in large, time-dependent deformations. Our method requires a simulator of deformable objects but places no significant restrictions on the simulator used. We use a sampling-based motion planner in conjunction with the simulator to generate a set of candidate plans based on expected deformations. Our method then uses the simulator and optimal control to numerically estimate time-dependent state distributions based on uncertain parameters (e.g. deformable material properties or actuation errors). We then select the plan with the highest estimated probability of successfully avoiding obstacles and reaching the goal region. Using FEM-based simulation of deformable tissues, we demonstrate the ability of our method to generate high quality plans in two medical-inspired scenarios: (1) guiding bevel-tip steerable needles through slices of deformable tissue around obstacles for minimally invasive biopsies and drug-delivery, and (2) manipulating planar tissues to align interior points at desired coordinates for precision treatment.
{"title":"Motion Planning Under Uncertainty In Highly Deformable Environments.","authors":"Sachin Patil, Jur van den, Berg Ron Alterovitz","doi":"10.15607/rss.2011.vii.033","DOIUrl":"https://doi.org/10.15607/rss.2011.vii.033","url":null,"abstract":"<p><p>Many tasks in robot-assisted surgery, food handling, manufacturing, and other applications require planning and controlling the motions of manipulators or other devices that must interact with highly deformable objects. We present a unified approach for motion planning under uncertainty in deformable environments that maximizes probability of success by accounting for uncertainty in deformation models, noisy sensing, and unpredictable actuation. Unlike prior planners that assume deterministic deformations or treat deformations as a type of small perturbation, our method explicitly considers the uncertainty in large, time-dependent deformations. Our method requires a simulator of deformable objects but places no significant restrictions on the simulator used. We use a sampling-based motion planner in conjunction with the simulator to generate a set of candidate plans based on expected deformations. Our method then uses the simulator and optimal control to numerically estimate time-dependent state distributions based on uncertain parameters (e.g. deformable material properties or actuation errors). We then select the plan with the highest estimated probability of successfully avoiding obstacles and reaching the goal region. Using FEM-based simulation of deformable tissues, we demonstrate the ability of our method to generate high quality plans in two medical-inspired scenarios: (1) guiding bevel-tip steerable needles through slices of deformable tissue around obstacles for minimally invasive biopsies and drug-delivery, and (2) manipulating planar tissues to align interior points at desired coordinates for precision treatment.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2011-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4096573/pdf/nihms-346279.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32507537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kris Hauser, Ron Alterovitz, Nuttapong Chentanez, Allison Okamura, Ken Goldberg
Bevel-tip steerable needles are a promising new technology for improving accuracy and accessibility in minimally invasive medical procedures. As yet, 3D needle steering has not been demonstrated in the presence of tissue deformation and uncertainty, despite the application of progressively more sophisticated planning algorithms. This paper presents a feedback controller that steers a needle along 3D helical paths, and varies the helix radius to correct for perturbations. It achieves high accuracy for targets sufficiently far from the needle insertion point; this is counterintuitive because the system is highly under-actuated and not locally controllable. The controller uses a model predictive control framework that chooses a needle twist rate such that the predicted helical trajectory minimizes the distance to the target. Fast branch and bound techniques enable execution at kilohertz rates on a 2GHz PC. We evaluate the controller under a variety of simulated perturbations, including imaging noise, needle deflections, and curvature estimation errors. We also test the controller in a 3D finite element simulator that incorporates deformation in the tissue as well as the needle. In deformable tissue examples, the controller reduced targeting error by up to 88% compared to open-loop execution.
{"title":"Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths.","authors":"Kris Hauser, Ron Alterovitz, Nuttapong Chentanez, Allison Okamura, Ken Goldberg","doi":"10.15607/rss.2009.v.037","DOIUrl":"https://doi.org/10.15607/rss.2009.v.037","url":null,"abstract":"<p><p>Bevel-tip steerable needles are a promising new technology for improving accuracy and accessibility in minimally invasive medical procedures. As yet, 3D needle steering has not been demonstrated in the presence of tissue deformation and uncertainty, despite the application of progressively more sophisticated planning algorithms. This paper presents a feedback controller that steers a needle along 3D helical paths, and varies the helix radius to correct for perturbations. It achieves high accuracy for targets sufficiently far from the needle insertion point; this is counterintuitive because the system is highly under-actuated and not locally controllable. The controller uses a model predictive control framework that chooses a needle twist rate such that the predicted helical trajectory minimizes the distance to the target. Fast branch and bound techniques enable execution at kilohertz rates on a 2GHz PC. We evaluate the controller under a variety of simulated perturbations, including imaging noise, needle deflections, and curvature estimation errors. We also test the controller in a 3D finite element simulator that incorporates deformation in the tissue as well as the needle. In deformable tissue examples, the controller reduced targeting error by up to 88% compared to open-loop execution.</p>","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"V ","pages":"37"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3004482/pdf/nihms191732.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"29553373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2007-06-27DOI: 10.15607/RSS.2007.III.012
H. Wakamatsu, E. Arai, S. Hirai
A modeling method for representing belt object deformation is proposed. Deformation of belt objects such as film circuit boards or flexible circuit boards must be estimated for automatic manipulation and assembly. In this paper, we assume that deformation of an inextensible belt object can be described by the shape of its central axis in a longitudinal direction called “the spine line” and lines with zero curvature called “rib lines”. This model is referred to as a “fishbone model” in this paper. First, we describe deformation of a rectangular belt object using differential geometry. Next, we propose the fishbone model considering characteristics of a developable surface, i.e., a surface without expansion or contraction. Then, we formulate potential energy of the object and constraints imposed on it. Finally, we explain a procedure to compute the deformed shape of the object and verify the validity of our proposed method by comparing some computational results with experimental results.
{"title":"Fishbone Model for Belt Object Deformation","authors":"H. Wakamatsu, E. Arai, S. Hirai","doi":"10.15607/RSS.2007.III.012","DOIUrl":"https://doi.org/10.15607/RSS.2007.III.012","url":null,"abstract":"A modeling method for representing belt object deformation is proposed. Deformation of belt objects such as film circuit boards or flexible circuit boards must be estimated for automatic manipulation and assembly. In this paper, we assume that deformation of an inextensible belt object can be described by the shape of its central axis in a longitudinal direction called “the spine line” and lines with zero curvature called “rib lines”. This model is referred to as a “fishbone model” in this paper. First, we describe deformation of a rectangular belt object using differential geometry. Next, we propose the fishbone model considering characteristics of a developable surface, i.e., a surface without expansion or contraction. Then, we formulate potential energy of the object and constraints imposed on it. Finally, we explain a procedure to compute the deformed shape of the object and verify the validity of our proposed method by comparing some computational results with experimental results.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"45 1","pages":"89-96"},"PeriodicalIF":0.0,"publicationDate":"2007-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91397358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.
{"title":"Efficient Motion Planning Based on Disassembly","authors":"Yuandong Yang, O. Brock","doi":"10.15607/RSS.2005.I.014","DOIUrl":"https://doi.org/10.15607/RSS.2005.I.014","url":null,"abstract":"Disassembly-based motion planning (DBMP) is a novel and efficient single-query, sampling-based motion planning approach for free-flying robots. Disassembly-based motion planning uses workspace information to determine the workspace volume of a potential solution path and uses this information to exclude large portions of configuration space from exploration. It also identifies the most constrained placements of the robot along the potential solution path. These placements are referred to as assemblies because they are highly constrained by the environment, much like parts in an assembly are constrained. The constraints limit the possible motions of the robot and thus can be exploited to further limit configuration space exploration. The use of these two sources of workspace information permits the solution of many practical problems with very limited configuration space exploration. This reduction in configuration space exploration results in performance improvements of several orders of magnitude, compared to state-of-the-art motion planning methods. For non-free-flying robots, disassembly-based motion planning performs at least as well as the sampling-based motion planning method it is based on.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"8 1","pages":"97-104"},"PeriodicalIF":0.0,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74667556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a biologically inspired, distributed coordination scheme based on nearest-neighbor interactions for a set of mobile kinematic agents equipped with vision sensors. It is assumed that each agent is only capable of measuring the following three quantities relative to each of its nearest neighbors (as defined by a proximity graph): time-to-collision, a single optical flow vector and relative bearing. We prove that the proposed distributed control law results in alignment of headings and flocking, even when the topology of the proximity graph representing the interconnection changes with time. It is shown that when the proximity graph is ”jointly connected” over time, flocking and velocity alignment will occur. Furthermore, the distributed control law can be extended to the case where the agents follow a leader. Under similar connectivity assumptions, we prove that the headings converge to that of the leader. Simulations are presented to demonstrate the effectiveness of this approach.
{"title":"Vision-based Distributed Coordination and Flocking of Multi-agent Systems","authors":"N. Moshtagh, A. Jadbabaie, Kostas Daniilidis","doi":"10.15607/RSS.2005.I.006","DOIUrl":"https://doi.org/10.15607/RSS.2005.I.006","url":null,"abstract":"We propose a biologically inspired, distributed coordination scheme based on nearest-neighbor interactions for a set of mobile kinematic agents equipped with vision sensors. It is assumed that each agent is only capable of measuring the following three quantities relative to each of its nearest neighbors (as defined by a proximity graph): time-to-collision, a single optical flow vector and relative bearing. We prove that the proposed distributed control law results in alignment of headings and flocking, even when the topology of the proximity graph representing the interconnection changes with time. It is shown that when the proximity graph is ”jointly connected” over time, flocking and velocity alignment will occur. Furthermore, the distributed control law can be extended to the case where the agents follow a leader. Under similar connectivity assumptions, we prove that the headings converge to that of the leader. Simulations are presented to demonstrate the effectiveness of this approach.","PeriodicalId":87357,"journal":{"name":"Robotics science and systems : online proceedings","volume":"124 1","pages":"41-48"},"PeriodicalIF":0.0,"publicationDate":"2005-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79755985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}