skip to main content

Explore Research Products in the NSF-PAR

Title: GAPCoD : A Generic Assembly Planner by Constrained Disassembly
In the literature we can find many kinds of modular robot that can build a wide variety of structures. In general, finding an assembly order to reach the final configuration, while respecting the insertion constraints of each kind of modular robot is a difficult process that requires system-specific tuning. In this article, we introduce a generic assembly planner by constrained disassembly (GAPCoD) which works with all kinds of modular robots. It outputs a directed acyclic graph where vertices are modules needing to be placed before his child nodes. This graph is obtained through the disassembly of the desired structure submitted to user chosen constraints. We detail the compiler as well as the way to choose constraints and their influence on performance. The robots embed simple path planning algorithm to reach the destination and act as decentralized agents. Examples are provided to show the possibilities that the compiler offers with two very different robot systems and constraints.  more » « less
Award ID(s):
1846340
NSF-PAR ID:
10150592
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
International Conference On Autonomous Agents and Multi-Agent Systems (AAMAS 2020)
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ( , 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS))
    null (Ed.)
    The modular assembly and actuation of 3D prin- ted milliscale cuboid robots using a globally applied magnetic field is presented. Cuboids are composed of a rectangular resin shell embedded with two spherical permanent magnets that can independently align with any applied magnetic field. Placing cuboids within short distances of each other allows for modular assembly and disassembly by changing magnetic field direction. Assembled cuboids are demonstrated to stably self-propel under sequential field inputs allowing for both rolling and pivot walking motion modes. Swarms of cuboids could be actuated within the working space and exhibit near identical behavior. Specialized ‘trap robots’ were developed to capture objects, transport them within the working space, and subsequently release the payload in a new location. Cuboids with male and female connectors were developed to exhibit the selective mating between cuboids. The results show that cuboids are a diverse and adaptable platform that has the potential to be scaled down to the sub-millimeter regime for use in medical or small-scale assembly applications. 
    more » « less
  2. ; ; ; ( , 2020 American Control Conference (ACC))
    Disassembly currently is a labor-intensive process with limited automation. The main reason lies in the fact that disassembly usually has to address model variations from different brands, physical uncertainties resulting from component defects or damage during usage, and incomplete product information. To overcome these challenges and to automate the disassembly process through human-robot collaboration, this paper develops a disassembly sequence planner which distributes the disassembly task between human and robot in a human-robot collaborative setting. This sequence planner targets to address potential issues including distinctive products, variant orientations, and safety constraints of human operators. The proposed disassembly sequence planner identifies the locations and orientations of the to-be-disassembled items, determines the starting point, and generates the optimal dis-assembly sequence while complying with the disassembly rules and considering the safe constraints for human operators. This algorithm is validated by numerical and experimental tests: the robot can successfully locate and disassemble the pieces following the obtained optimal sequence, and complete the task via collaboration with the human operator without violating the constraints. 
    more » « less
  3. ; ( , IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS))
    null (Ed.)
    We consider the problem of enhanced security of multi-robot systems to prevent cyber-attackers from taking control of one or more robots in the group. We build upon a recently proposed solution that utilizes the physical measurement capabilities of the robots to perform introspection, i.e., detect the malicious actions of compromised agents using other members of the group. In particular, the proposed solution finds multi-agent paths on discrete spaces combined with a set of mutual observations at specific locations to detect robots with significant deviations from the preordained routes. In this paper, we develop a planner that works on continuous configuration spaces while also taking into account similar spatio-temporal constraints. In addition, the planner allows for more general tasks that can be formulated as arbitrary smooth cost functions to be specified. The combination of constraints and objectives considered in this paper are not easily handled by popular path planning algorithms (e.g., sampling-based methods), thus we propose a method based on the Alternating Direction Method of Multipliers (ADMM). ADMM is capable of finding locally optimal solutions to problems involving different kinds of objectives and non-convex temporal and spatial constraints, and allows for infeasible initialization. We benchmark our proposed method on multi-agent map exploration with minimum-uncertainty cost function, obstacles, and observation schedule constraints. 
    more » « less
  4. ; ; ; ; ; ; ( , Soft Robotics)
    null (Ed.)
    Today’s use of large-scale industrial robots is enabling extraordinary achievement on the assembly line, but these robots remain isolated from the humans on the factory floor because they are very powerful, and thus dangerous to be around. In contrast, the soft robotics research community has proposed soft robots that are safe for human environments. The current state of the art enables the creation of small-scale soft robotic devices. In this article we address the gap between small-scale soft robots and the need for human-sized safe robots by introducing a new soft robotic module and multiple human-scale robot configurations based on this module. We tackle large-scale soft robots by presenting a modular and reconfigurable soft robotic platform that can be used to build fully functional and untethered meter-scale soft robots. These findings indicate that a new wave of human-scale soft robots can be an alternative to classic rigid-bodied robots in tasks and environments where humans and machines can work side by side with capabilities that include, but are not limited to, autonomous legged locomotion and grasping. 
    more » « less
  5. ; ; ( , Journal of Artificial Intelligence Research)
    null (Ed.)
    This paper introduces and studies a graph-based variant of the path planning problem arising in hostile environments. We consider a setting where an agent (e.g. a robot) must reach a given destination while avoiding being intercepted by probabilistic entities which exist in the graph with a given probability and move according to a probabilistic motion pattern known a priori. Given a goal vertex and a deadline to reach it, the agent must compute the path to the goal that maximizes its chances of survival. We study the computational complexity of the problem, and present two algorithms for computing high quality solutions in the general case: an exact algorithm based on Mixed-Integer Nonlinear Programming, working well in instances of moderate size, and a pseudo-polynomial time heuristic algorithm allowing to solve large scale problems in reasonable time. We also consider the two limit cases where the agent can survive with probability 0 or 1, and provide specialized algorithms to detect these kinds of situations more efficiently. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email