Motion Primitives and Planning for Robots with Closed Chain Systems and Changing Topologies

When operating in human environments, a robot should use predictable motions that allow humans to trust and anticipate its behavior. Heuristic search-based planning offers predictable motions and guarantees on completeness and sub-optimality of solutions. While search-based planning on motion primitive-based (lattice-based) graphs has been used extensively in navigation, application to high-dimensional state-spaces has, until recently, been thought impractical. This dissertation presents methods we have developed for applying these graphs to mobile manipulation, specifically for systems which contain closed chains. The formation of closed chains in tasks that involve contacts with the environment may reduce the number of available degrees-of-freedom but adds complexity in terms of constraints in the high-dimensional state-space. We exploit the dimensionality reduction inherent in closed kinematic chains to get efficient search-based planning. Our planner handles changing topologies (switching between open and closed-chains) in a single plan, including what transitions to include and when to include them. Thus, we can leverage existing results for search-based planning for open chains, combining open and closed chain manipulation planning into one framework. Proofs regarding the framework are introduced for the application to graph-search and its theoretical guarantees of optimality. The dimensionality-reduction is done in a manner that enables finding optimal solutions to low-dimensional problems which map to correspondingly optimal full-dimensional solutions. We apply this framework to planning for opening and navigating through non-spring and spring-loaded doors using a Willow Garage PR2. The framework motivates our approaches to the Atlas humanoid robot from Boston Dynamics for both stationary manipulation and quasi-static walking, as a closed chain is formed when both feet are on the ground

Data Fusion Methods and Algorithms in the Context of Autonomous Systems - A path planning algorithms analysis and optimization exploiting fused data

L'abstract è presente nell'allegato / the abstract is in the attachmen

Probabilistic Hybrid Action Models for Predicting Concurrent Percept-driven Robot Behavior

This article develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern percept-driven robot plans. PHAMs represent aspects of robot behavior that cannot be represented by most action models used in AI planning: the temporal structure of continuous control processes, their non-deterministic effects, several modes of their interferences, and the achievement of triggering conditions in closed-loop robot plans. The main contributions of this article are: (1) PHAMs, a model of concurrent percept-driven behavior, its formalization, and proofs that the model generates probably, qualitatively accurate predictions; and (2) a resource-efficient inference method for PHAMs based on sampling projections from probabilistic action models and state descriptions. We show how PHAMs can be applied to planning the course of action of an autonomous robot office courier based on analytical and experimental results

기구학적 및 동적 제한조건들을 고려한 모바일 매니퓰레이터의 작업 중심 전신 동작 생성 전략

학위논문(박사) -- 서울대학교대학원 : 융합과학기술대학원 융합과학부(지능형융합시스템전공), 2023. 2. 박재흥.모바일 매니퓰레이터는 모바일 로봇에 장착된 매니퓰레이터입니다. 모바일 매니퓰레이터는 고정형 매니퓰레이터에 비해 모바일 로봇의 이동성을 제공받기 때문에 다양하고 복잡한 작업을 수행할 수 있습니다. 그러나 두 개의 서로 다른 시스템을 결합함으로써 모바일 매니퓰레이터의 전신을 계획하고 제어할 때 여러 특징을 고려해야 합니다. 이러한 특징들은 여자유도, 두 시스템의 관성 차이 및 모바일 로봇의 비홀로노믹 제한 조건 등이 있습니다. 본 논문의 목적은 기구학적 및 동적 제한조건들을 고려하여 모바일 매니퓰레이터의 전신 동작 생성 전략을 제안하는 것입니다. 먼저, 모바일 매니퓰레이터가 초기 위치에서 문을 통과하여 목표 위치에 도달하기 위한 전신 경로를 계산하는 프레임워크를 제안합니다. 이 프레임워크는 로봇과 문에 의해 생기는 기구학적 제한조건을 고려합니다. 제안하는 프레임워크는 두 단계를 거쳐 전신의 경로를 얻습니다. 첫 번째 단계에서는 그래프 탐색 알고리즘을 이용하여 모바일 로봇의 자세 경로와 문의 각도 경로를 계산합니다. 특히, 그래프 탐색에서 area indicator라는 정수 변수를 상태의 구성 요소로서 정의하는데, 이는 문에 대한 모바일 로봇의 상대적 위치를 나타냅니다. 두 번째 단계에서는 모바일 로봇의 경로와 문의 각도를 통해 문의 손잡이 위치를 계산하고 역기구학을 활용하여 매니퓰레이터의 관절 위치를 계산합니다. 제안된 프레임워크의 효율성은 비홀로노믹 모바일 매니퓰레이터를 사용한 시뮬레이션 및 실제 실험을 통해 검증되었습니다. 둘 째, 최적화 방법을 기반으로한 전신 제어기를 제안합니다. 이 방법은 등식 및 부등식 제한조건 모두에 대해 가중 행렬을 반영한 계층적 최적화 문제의 해를 계산합니다. 이 방법은 모바일 매니퓰레이터 또는 휴머노이드와 같이 자유도가 많은 로봇의 여자유도를 해결하기 위해 개발되어 작업 우선 순위에 따라 가중치가 다른 관절 동작으로 여러 작업을 수행할 수 있습니다. 제안된 방법은 가중 행렬을 최적화 문제의 1차 최적 조건을 만족하도록 하며, Active-set 방법을 활용하여 등식 및 부등식 작업을 처리합니다. 또한, 대칭적인 영공간 사영 행렬을 사용하여 계산상 효율적입니다. 결과적으로, 제안된 제어기를 활용하는 로봇은 우선 순위에 따라 개별적인 관절 가중치를 반영하여 전신 움직임을 효과적으로 보여줍니다. 제안된 제어기의 효용성은 모바일 매니퓰레이터와 휴머노이드를 이용한 실험을 통해 검증하였습니다. 마지막으로, 모바일 매니퓰레이터의 동적 제한조건들 중 하나로서 자가 충돌 회피 알고리즘을 제안합니다. 제안된 방법은 매니퓰레이터와 모바일 로봇 간의 자가 충돌에 중점을 둡니다. 모바일 로봇의 버퍼 영역을 둘러싸는 3차원 곡면인 distance buffer border의 개념을 정의합니다. 버퍼 영역의 두께는 버퍼 거리입니다. 매니퓰레이터와 모바일 로봇 사이의 거리가 버퍼 거리보다 작은 경우, 즉 매니퓰레이터가 모바일 로봇의 버퍼 영역 내부에 있는 경우 제안된 전략은 매니퓰레이터를 버퍼 영역 밖으로 내보내기 위해 모바일 로봇의 움직임을 생성합니다. 따라서 매니퓰레이터는 미리 정의된 매니퓰레이터의 움직임을 수정하지 않고도 모바일 로봇과의 자가 충돌을 피할 수 있습니다. 모바일 로봇의 움직임은 가상의 힘을 가함으로써 생성됩니다. 특히, 힘의 방향은 차동 구동 이동 로봇의 비홀로노믹 제약 및 조작기의 도달 가능성을 고려하여 결정됩니다. 제안된 알고리즘은 7자유도 로봇팔을 가진 차동 구동 모바일 로봇에 적용하여 다양한 실험 시나리오에서 입증되었습니다.A mobile manipulator is a manipulator mounted on a mobile robot. Compared to a fixed-base manipulator, the mobile manipulator can perform various and complex tasks because the mobility is offered by the mobile robot. However, combining two different systems causes several features to be considered when generating the whole-body motion of the mobile manipulator. The features include redundancy, inertia difference, and non-holonomic constraint. The purpose of this thesis is to propose the whole-body motion generation strategy of the mobile manipulator for considering kinematic and dynamic constraints. First, a planning framework is proposed that computes a path for the whole-body configuration of the mobile manipulator to navigate from the initial position, traverse through the door, and arrive at the target position. The framework handles the kinematic constraint imposed by the closed-chain between the robot and door. The proposed framework obtains the path of the whole-body configuration in two steps. First, the path for the pose of the mobile robot and the path for the door angle are computed by using the graph search algorithm. In graph search, an integer variable called area indicator is introduced as an element of state, which indicates where the robot is located relative to the door. Especially, the area indicator expresses a process of door traversal. In the second step, the configuration of the manipulator is computed by the inverse kinematics (IK) solver from the path of the mobile robot and door angle. The proposed framework has a distinct advantage over the existing methods that manually determine several parameters such as which direction to approach the door and the angle of the door required for passage. The effectiveness of the proposed framework was validated through experiments with a nonholonomic mobile manipulator. Second, a whole-body controller is presented based on the optimization method that can consider both equality and inequality constraints. The method computes the optimal solution of the weighted hierarchical optimization problem. The method is developed to resolve the redundancy of robots with a large number of Degrees of Freedom (DOFs), such as a mobile manipulator or a humanoid, so that they can execute multiple tasks with differently weighted joint motion for each task priority. The proposed method incorporates the weighting matrix into the first-order optimality condition of the optimization problem and leverages an active-set method to handle equality and inequality constraints. In addition, it is computationally efficient because the solution is calculated in a weighted joint space with symmetric null-space projection matrices for propagating recursively to a low priority task. Consequently, robots that utilize the proposed controller effectively show whole-body motions handling prioritized tasks with differently weighted joint spaces. The effectiveness of the proposed controller was validated through experiments with a nonholonomic mobile manipulator as well as a humanoid. Lastly, as one of dynamic constraints for the mobile manipulator, a reactive self-collision avoidance algorithm is developed. The proposed method mainly focuses on self-collision between a manipulator and the mobile robot. We introduce the concept of a distance buffer border (DBB), which is a 3D curved surface enclosing a buffer region of the mobile robot. The region has the thickness equal to buffer distance. When the distance between the manipulator and mobile robot is less than the buffer distance, i.e. the manipulator lies inside the buffer region of the mobile robot, the proposed strategy is to move the mobile robot away from the manipulator in order for the manipulator to be placed outside the border of the region, the DBB. The strategy is achieved by exerting force on the mobile robot. Therefore, the manipulator can avoid self-collision with the mobile robot without modifying the predefined motion of the manipulator in a world Cartesian coordinate frame. In particular, the direction of the force is determined by considering the non-holonomic constraint of the differentially driven mobile robot. Additionally, the reachability of the manipulator is considered to arrive at a configuration in which the manipulator can be more maneuverable. To realize the desired force and resulting torque, an avoidance task is constructed by converting them into the accelerations of the mobile robot and smoothly inserted with a top priority into the controller. The proposed algorithm was implemented on a differentially driven mobile robot with a 7-DOFs robotic arm and its performance was demonstrated in various experimental scenarios.1 INTRODUCTION 1 1.1 Motivation 1 1.2 Contributions of thesis 2 1.3 Overview of thesis 3 2 WHOLE-BODY MOTION PLANNER : APPLICATION TO NAVIGATION INCLUDING DOOR TRAVERSAL 5 2.1 Background & related works 7 2.2 Proposed framework 9 2.2.1 Computing path for mobile robot and door angle - S1 10 2.2.1.1 State 10 2.2.1.2 Action 13 2.2.1.3 Cost 15 2.2.1.4 Search 18 2.2.2 Computing path for arm configuration - S2 20 2.3 Results 21 2.3.1 Application to pull and push-type door 21 2.3.2 Experiment in cluttered environment 22 2.3.3 Experiment with different robot platform 23 2.3.4 Comparison with separate planning by existing works 24 2.3.5 Experiment with real robot 29 2.4 Conclusion 29 3 WHOLE-BODY CONTROLLER : WEIGHTED HIERARCHICAL QUADRATIC PROGRAMMING 31 3.1 Related works 32 3.2 Problem statement 34 3.2.1 Pseudo-inverse with weighted least-squares norm for each task 35 3.2.2 Problem statement 37 3.3 WHQP with equality constraints 37 3.4 WHQP with inequality constraints 45 3.5 Experimental results 48 3.5.1 Simulation experiment with nonholonomic mobile manipulator 48 3.5.1.1 Scenario description 48 3.5.1.2 Task and weighting matrix description 49 3.5.1.3 Results 51 3.5.2 Real experiment with nonholonomic mobile manipulator 53 3.5.2.1 Scenario description 53 3.5.2.2 Task and weighting matrix description 53 3.5.2.3 Results 54 3.5.3 Real experiment with humanoid 55 3.5.3.1 Scenario description 55 3.5.3.2 Task and weighting matrix description 55 3.5.3.3 Results 57 3.6 Discussions and implementation details 57 3.6.1 Computation cost 57 3.6.2 Composite weighting matrix in same hierarchy 59 3.6.3 Nullity of WHQP 59 3.7 Conclusion 59 4 WHOLE-BODY CONSTRAINT : SELF-COLLISION AVOIDANCE 61 4.1 Background & related Works 64 4.2 Distance buffer border and its score computation 65 4.2.1 Identification of potentially colliding link pairs 66 4.2.2 Distance buffer border 67 4.2.3 Evaluation of distance buffer border 69 4.2.3.1 Singularity of the differentially driven mobile robot 69 4.2.3.2 Reachability of the manipulator 72 4.2.3.3 Score of the DBB 74 4.3 Self-collision avoidance algorithm 75 4.3.1 Generation of the acceleration for the mobile robot 76 4.3.2 Generation of the repulsive acceleration for the other link pair 82 4.3.3 Construction of an acceleration-based task for self-collision avoidance 83 4.3.4 Insertion of the task in HQP-based controller 83 4.4 Experimental results 86 4.4.1 System overview 87 4.4.2 Experimental results 87 4.4.2.1 Self-collision avoidance while tracking the predefined trajectory 87 4.4.2.2 Self-collision avoidance while manually guiding the end-effector 89 4.4.2.3 Extension to obstacle avoidance when opening the refrigerator 91 4.4.3 Discussion 94 4.5 Conclusion 95 5 CONCLUSIONS 97 Abstract (In Korean) 113 Acknowlegement 116박

Behavior based autonomous mobile Robot for industrial logistics

The design of robot behaviors to meet the requirements of the new industrial era - Industry 4.0 - has grown significantly in recent years. Especially the demand for flexible and adaptable systems has increased exponentially since intelligent robots started to be integrated into assembly lines and replace human activities. Tools such as Finite State Machines have proven to be an understandable and quick way to solve high-level problems in robotics; however, unmanageable when complexity rises. They become confusing and unreadable, making their modification and mainte- nance a problem. New tools, such as Behavior Trees, have emerged, creating modular, flexible, and adaptable systems without sacrificing readability with the increased com- plexity. The proposed architecture follows a hierarchical layered approach taking advantage of Behavior Trees, developing modular robot skills and system interfaces to create an autonomous behavior-based system. The software was implemented and tested in an Autonomous Mobile Robot capable of navigating complex environments and executing basic tasks. The results showed real advantages in using the layer-based approach, particularly giving the system modularity and increased flexibility capable of being easily improved and used in other systems. It was also concluded that Behavior Trees are an adequate tool for reactive systems in highly dynamic environments.Nos últimos anos, tem-se verificado um crescimentos na modelação de comportamen- tos robóticos com o objetivo de satisfazer necessidades dos novos paradigmas da indústria. Em particular, na indústria 4.0, com a integração de robôs nas linhas de produção e a subs- tituição dos humanos em diversas atividades, tem-se verificado um aumento na exigência de sistemas mais adaptáveis e flexíveis. Ferramentas tais como as máquinas de estado provaram ser percetíveis e de fácil uti- lização na resolução de problemas na área da robótica. No entanto, com o aumento da complexidade, tornam-se problemáticas pela sua desorganização e ilegibilidade. Por con- seguinte, emergiram novas estruturas, tais como as árvores de comportamento, capazes de tornar os sistemas mais modulares e flexíveis. A arquitetura por hierarquisação de camadas proposta, tira partido das vantagens das árvores de comportamento, com o desenvolvimento de comportamentos e interfaces de modo a criar um sistema reativo e autónomo. O software foi implementado e testado num robô móvel autónomo, capaz de navegar em ambientes complexos e de executar tarefas basicas. Os resultados mostraram vantagens na utilização da arquitetura proposta, em parti- cular, trazendo modularidade e flexibilidade ao sistema robótico, permitindo uma futura melhoria de cada um dos módulos, tal como, a sua utilização noutros sistemas

Longterm Generalized Actions for Smart, Autonomous Robot Agents

Creating intelligent artificial systems, and in particular robots, that improve themselves just like humans do is one of the most ambitious goals in robotics and machine learning. The concept of robot experience exists for some time now, but has up to now not fully found its way into autonomous robots. This thesis is devoted to both, analyzing the underlying requirements for enabling robot learning from experience and actually implementing it on real robot hardware. For effective robot learning from experience I present and discuss three main requirements: (a ) Clearly expressing what a robot should do, on a vague, abstract level I introduce Generalized Plans as a means to express the intention rather than the actual action sequence of a task, removing as much task specific knowledge as possible. (a ) Defining, collecting, and analyzing robot experiences to enable robots to improve I present Episodic Memories as a container for all collected robot experiences for any arbitrary task and create sophisticated action (effect) prediction models from them, allowing robots to make better decisions. (a ) Properly abstracting from reality and dealing with failures in the domain they occurred in I propose failure handling strategies, a failure taxonomy extensible through experience, and discuss the relationship between symbolic/discrete and subsymbolic/continuous systems in terms of robot plans interacting with real world sensors and actuators. I concentrate on the domain of human-scale robot activities, specifically on doing household chores. Tasks in this domain offer many repeating patterns and are ideal candidates for abstracting, encapsulating, and modularizing robot plans into a more general form. This way, very similar plan structures are transformed into parameters that change the behavior of the robot while performing the task, making the plans more flexible. While performing tasks, robots encounter the same or similar situations over and over again. Albeit humans are able to benefit from this and improve at what they do, robots in general lack this ability. This thesis presents techniques for collecting and making robot experiences accessible to robots and outside observers alike, answering high level questions such as What are good spots to stand at for grasping objects from the fridge? or Which objects are especially difficult to grasp with two hands while they are in the oven? . By structuring and tapping into a robot's memory, it can make more informed decisions that are not based on manually encoded information, but self-improved behavior. To this end, I present several experience-based approaches to improve a robot's autonomous decisions, such as parameter choices, during execution time. Robots that interact with the real world are bound to deal with unexpected events and must properly react to failures of any kind of action. I present an extensible failure model that suits the structure of Generalized Plans and Episodic Memories and make clear how each module should deal with their own failures rather than directly handing them up to a governing cognitive architecture. In addition, I make a distinction between discrete parametrizations of Generalized Plans and continuous low level components, and how to translate between the two

A Single Planner for a Composite Task of Approaching, Opening and Navigating through Non-spring and Spring-loaded Doors

Abstract — Opening and navigating through doors remains a challenging problem, particularly in cluttered environments and for spring-loaded doors. Passing through doors, especially spring-loaded doors, requires making and breaking contacts with the door and preventing the door from closing while passing through. In this work, we present a planning framework that handles non-spring and spring-loaded doors, in cluttered or confined workspaces, planning the approach to the door, pushing or pulling it open, and passing through. Because the problem is solved in a combined search space, the planner yields an overall least-cost path. The planner is able to insert a transition between robot-door contacts at any point along the plan. We utilize a compact graph-based representation of the problem to keep planning times low. We precompute the force workspace of the end-effectors to eliminate checks against joint torque limits at plan time. We have validated our solution in both simulation and real-world experiments on the PR2 mobile manipulation platform; the robot is able to successfully open a variety of spring-loaded and non-spring-loaded doors by pushing and pulling. I

Conference on Intelligent Robotics in Field, Factory, Service, and Space (CIRFFSS 1994), volume 1

The AIAA/NASA Conference on Intelligent Robotics in Field, Factory, Service, and Space (CIRFFSS '94) was originally proposed because of the strong belief that America's problems of global economic competitiveness and job creation and preservation can partly be solved by the use of intelligent robotics, which are also required for human space exploration missions. Individual sessions addressed nuclear industry, agile manufacturing, security/building monitoring, on-orbit applications, vision and sensing technologies, situated control and low-level control, robotic systems architecture, environmental restoration and waste management, robotic remanufacturing, and healthcare applications

Mobile Robots Navigation

Mobile robots navigation includes different interrelated activities: (i) perception, as obtaining and interpreting sensory information; (ii) exploration, as the strategy that guides the robot to select the next direction to go; (iii) mapping, involving the construction of a spatial representation by using the sensory information perceived; (iv) localization, as the strategy to estimate the robot position within the spatial map; (v) path planning, as the strategy to find a path towards a goal location being optimal or not; and (vi) path execution, where motor actions are determined and adapted to environmental changes. The book addresses those activities by integrating results from the research work of several authors all over the world. Research cases are documented in 32 chapters organized within 7 categories next described