1,879 research outputs found

    Conditional Task and Motion Planning through an Effort-based Approach

    Full text link
    This paper proposes a preliminary work on a Conditional Task and Motion Planning algorithm able to find a plan that minimizes robot efforts while solving assigned tasks. Unlike most of the existing approaches that replan a path only when it becomes unfeasible (e.g., no collision-free paths exist), the proposed algorithm takes into consideration a replanning procedure whenever an effort-saving is possible. The effort is here considered as the execution time, but it is extensible to the robot energy consumption. The computed plan is both conditional and dynamically adaptable to the unexpected environmental changes. Based on the theoretical analysis of the algorithm, authors expect their proposal to be complete and scalable. In progress experiments aim to prove this investigation

    Reconfigurable and Agile Legged-Wheeled Robot Navigation in Cluttered Environments with Movable Obstacles

    Get PDF
    Legged and wheeled locomotion are two standard methods used by robots to perform navigation. Combining them to create a hybrid legged-wheeled locomotion results in increased speed, agility, and reconfigurability for the robot, allowing it to traverse a multitude of environments. The CENTAURO robot has these advantages, but they are accompanied by a higher-dimensional search space for formulating autonomous economical motion plans, especially in cluttered environments. In this article, we first review our previously presented legged-wheeled footprint reconfiguring global planner. We describe the two incremental prototypes, where the primary goal of the algorithms is to reduce the search space of possible footprints such that plans that expand the robot over the low-lying wide obstacles or narrow into passages can be computed with speed and efficiency. The planner also considers the cost of avoiding obstacles versus negotiating them by expanding over them. The second part of this article presents our new work on local obstacle pushing, which further increases the number of tight scenarios the planner can solve. The goal of the new local push-planner is to place any movable obstacle of unknown mass and inertial properties, obstructing the previously planned trajectory from our global planner, to a location devoid of obstruction. This is done while minimising the distance traveled by the robot, the distance the object is pushed, and its rotation caused by the push. Together, the local and global planners form a major part of the agile reconfigurable navigation suite for the legged-wheeled hybrid CENTAURO robot

    Reactive Planning for Mobile Manipulation Tasks in Unexplored Semantic Environments

    Get PDF
    Complex manipulation tasks, such as rearrangement planning of numerous objects, are combinatorially hard problems. Existing algorithms either do not scale well or assume a great deal of prior knowledge about the environment, and few offer any rigorous guarantees. In this paper, we propose a novel hybrid control architecture for achieving such tasks with mobile manipulators. On the discrete side, we enrich a temporal logic specification with mobile manipulation primitives such as moving to a point, and grasping or moving an object. Such specifications are translated to an automaton representation, which orchestrates the physical grounding of the task to mobility or manipulation controllers. The grounding from the discrete to the continuous reactive controller is online and can respond to the discovery of unknown obstacles or decide to push out of the way movable objects that prohibit task accomplishment. Despite the problem complexity, we prove that, under specific conditions, our architecture enjoys provable completeness on the discrete side, provable termination on the continuous side, and avoids all obstacles in the environment. Simulations illustrate the efficiency of our architecture that can handle tasks of increased complexity while also responding to unknown obstacles or unanticipated adverse configurations. For more information: Kod*la

    Using a mobile robot for hazardous substances detection in a factory environment

    Get PDF
    Dupla diplomação com a UTFPR - Universidade Tecnológica Federal do ParanáIndustries that work with toxic materials need extensive security protocols to avoid accidents. Instead of having fixed sensors, the concept of assembling the sensors on a mobile robot that performs the scanning through a defined path is cheaper, configurable and adaptable. This work describes a mobile robot, equipped with several gas sensors and LIDAR, that follows a trajectory based on waypoints, simulating a working Autonomous Guided Vehicle (AGV). At the same time, the robot keeps measuring for toxic gases. In other words, the robot follows the trajectory while the gas concentration is under a defined value. Otherwise, it starts the autonomous leakage search based on a search algorithm that allows to find the leakage position avoiding obstacles in real time. The proposed methodology is verified in simulation based on a model of the real robot. Therefore, three path plannings were developed and their performance compared. A Light Detection And Ranging (LIDAR) device was integrated with the path planning to propose an obstacle avoidance system with a dilation technique to enlarge the obstacles, thus, considering the robot’s dimensions. Moreover, if needed, the robot can be remotely operated with visual feedback. In addition, a controller was made for the robot. Gas sensors were embedded in the robot with Finite Impulse Response (FIR) filter to process the data. A low cost AGV was developed to compete in Festival Nacional de Robótica (Portuguese Robotics Open) 2019 - Gondomar, describing the robot’s control and software solution to the competition.As indústrias que trabalham com materiais tóxicos necessitam de extensos protocolos de segurança para evitar acidentes. Ao invés de ter sensores estáticos, o conceito de instalar sensores em um robô móvel que inspeciona através de um caminho definido é mais barato, configurável e adaptável. O presente trabalho descreve um robô móvel, equipado com vários sensores de gás e LIDAR, que percorre uma trajetória baseada em pontos de controle, simulando um AGV em trabalho. Em simultâneo são efetuadas medidas de gases tóxicos. Em outras palavras, o robô segue uma trajetória enquanto a concentração de gás está abaixo de um valor definido. Caso contrário, inicia uma busca autônoma de vazamento de gás com um algoritmo de busca que permite achar a posição do gás evitando os obstáculos em tempo real. A metodologia proposta é verificada em simulação. Três algoritmos de planejamento de caminho foram desenvolvidos e suas performances comparadas. Um LIDAR foi integrado com o planejamento de caminho para propôr um sistema de evitar obstáculos. Além disso, o robô pode ser operado remotamente com auxílio visual. Foi feito um controlador para o robô. Sensores de gás foram embarcados no robô com um filtro de resposta ao impulso finita para processar as informações. Um veículo guiado automático de baixo custo foi desenvolvido para competir no Festival Nacional de Robótica 2019 - Gondomar. O controle do veículo foi descrito com o programa de solução para a competição

    Planning manipulation movements of a dual-arm system considering obstacle removing

    Get PDF
    The paper deals with the problem of planning movements of two hand-arm robotic systems, considering the possibility of using the robot hands to remove potential obstacles in order to obtain a free access to grasp a desired object. The approach is based on a variation of a Probabilistic Road Map that does not rule out the samples implying collisions with removable objects but instead classifies them according to the collided obstacle(s), and allows the search of free paths with the indication of which objects must be removed from the work-space to make the path actually valid; we call it Probabilistic Road Map with Obstacles (PRMwO). The proposed system includes a task assignment system that distributes the task among the robots, using for that purpose a precedence graph built from the results of the PRMwO. The approach has been implemented for a real dual-arm robotic system, and some simulated and real running examples are presented in the paper. (C) 2014 Elsevier B.V. All rights reserved.Postprint (published version
    • …
    corecore