3,536 research outputs found

    Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Age

    Get PDF
    Simultaneous Localization and Mapping (SLAM)consists in the concurrent construction of a model of the environment (the map), and the estimation of the state of the robot moving within it. The SLAM community has made astonishing progress over the last 30 years, enabling large-scale real-world applications, and witnessing a steady transition of this technology to industry. We survey the current state of SLAM. We start by presenting what is now the de-facto standard formulation for SLAM. We then review related work, covering a broad set of topics including robustness and scalability in long-term mapping, metric and semantic representations for mapping, theoretical performance guarantees, active SLAM and exploration, and other new frontiers. This paper simultaneously serves as a position paper and tutorial to those who are users of SLAM. By looking at the published research with a critical eye, we delineate open challenges and new research issues, that still deserve careful scientific investigation. The paper also contains the authors' take on two questions that often animate discussions during robotics conferences: Do robots need SLAM? and Is SLAM solved

    Consensus reaching in swarms ruled by a hybrid metric-topological distance

    Full text link
    Recent empirical observations of three-dimensional bird flocks and human crowds have challenged the long-prevailing assumption that a metric interaction distance rules swarming behaviors. In some cases, individual agents are found to be engaged in local information exchanges with a fixed number of neighbors, i.e. a topological interaction. However, complex system dynamics based on pure metric or pure topological distances both face physical inconsistencies in low and high density situations. Here, we propose a hybrid metric-topological interaction distance overcoming these issues and enabling a real-life implementation in artificial robotic swarms. We use network- and graph-theoretic approaches combined with a dynamical model of locally interacting self-propelled particles to study the consensus reaching pro- cess for a swarm ruled by this hybrid interaction distance. Specifically, we establish exactly the probability of reaching consensus in the absence of noise. In addition, simulations of swarms of self-propelled particles are carried out to assess the influence of the hybrid distance and noise

    Computational Models of Consciousness-Emotion Interactions in Social Robotics: Conceptual Framework

    Get PDF
    There is a little information on how to design a social robot that effectively executes consciousness-emotion (C-E) interaction in a socially acceptable manner. In fact, development of such socially sophisticated interactions depends on models of human high-level cognition implemented in the robotโ€™s design. Therefore, a fundamental research problem of social robotics in terms of effective C-E interaction processing is to define a computational architecture of the robotic system in which the cognitive-emotional integration occurs and determine cognitive mechanisms underlying consciousness along with its subjective aspect in detecting emotions. Our conceptual framework rests upon assumptions of a computational approach to consciousness, which points out that consciousness and its subjective aspect are specific functions of the human brain that can be implemented into an artificial social robotโ€™s construction. Such research framework of developing C-E addresses a field of machine consciousness that indicates important computational correlates of consciousness in such an artificial system and the possibility to objectively describe such mechanisms with quantitative parameters based on signal-detection and threshold theories

    Towards a Cyber-Physical Manufacturing Cloud through Operable Digital Twins and Virtual Production Lines

    Get PDF
    In last decade, the paradigm of Cyber-Physical Systems (CPS) has integrated industrial manufacturing systems with Cloud Computing technologies for Cloud Manufacturing. Up to 2015, there were many CPS-based manufacturing systems that collected real-time machining data to perform remote monitoring, prognostics and health management, and predictive maintenance. However, these CPS-integrated and network ready machines were not directly connected to the elements of Cloud Manufacturing and required human-in-the-loop. Addressing this gap, we introduced a new paradigm of Cyber-Physical Manufacturing Cloud (CPMC) that bridges a gap between physical machines and virtual space in 2017. CPMC virtualizes machine tools in cloud through web services for direct monitoring and operations through Internet. Fundamentally, CPMC differs with contemporary modern manufacturing paradigms. For instance, CPMC virtualizes machining tools in cloud using remote services and establish direct Internet-based communication, which is overlooked in existing Cloud Manufacturing systems. Another contemporary, namely cyber-physical production systems enable networked access to machining tools. Nevertheless, CPMC virtualizes manufacturing resources in cloud and monitor and operate them over the Internet. This dissertation defines the fundamental concepts of CPMC and expands its horizon in different aspects of cloud-based virtual manufacturing such as Digital Twins and Virtual Production Lines. Digital Twin (DT) is another evolving concept since 2002 that creates as-is replicas of machining tools in cyber space. Up to 2018, many researchers proposed state-of-the-art DTs, which only focused on monitoring production lifecycle management through simulations and data driven analytics. But they overlooked executing manufacturing processes through DTs from virtual space. This dissertation identifies that DTs can be made more productive if they engage directly in direct execution of manufacturing operations besides monitoring. Towards this novel approach, this dissertation proposes a new operable DT model of CPMC that inherits the features of direct monitoring and operations from cloud. This research envisages and opens the door for future manufacturing systems where resources are developed as cloud-based DTs for remote and distributed manufacturing. Proposed concepts and visions of DTs have spawned the following fundamental researches. This dissertation proposes a novel concept of DT based Virtual Production Lines (VPL) in CPMC in 2019. It presents a design of a service-oriented architecture of DTs that virtualizes physical manufacturing resources in CPMC. Proposed DT architecture offers a more compact and integral service-oriented virtual representations of manufacturing resources. To re-configure a VPL, one requirement is to establish DT-to-DT collaborations in manufacturing clouds, which replicates to concurrent resource-to-resource collaborations in shop floors. Satisfying the above requirements, this research designs a novel framework to easily re-configure, monitor and operate VPLs using DTs of CPMC. CPMC publishes individual web services for machining tools, which is a traditional approach in the domain of service computing. But this approach overcrowds service registry databases. This dissertation introduces a novel fundamental service publication and discovery approach in 2020, OpenDT, which publishes DTs with collections of services. Experimental results show easier discovery and remote access of DTs while re-configuring VPLs. Proposed researches in this dissertation have received numerous citations both from industry and academia, clearly proving impacts of research contributions

    \u3cem\u3eGRASP News\u3c/em\u3e, Volume 8, Number 1

    Get PDF
    A report of the General Robotics and Active Sensory Perception (GRASP) Laboratory. Edited by Thomas Lindsay

    ํ•™์Šต ๊ธฐ๋ฐ˜ ์ž์œจ์‹œ์Šคํ…œ์˜ ๋ฆฌ์Šคํฌ๋ฅผ ๊ณ ๋ คํ•˜๋Š” ๋ถ„ํฌ์  ๊ฐ•์ธ ์ตœ์ ํ™”

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ „๊ธฐยท์ •๋ณด๊ณตํ•™๋ถ€, 2020. 8. ์–‘์ธ์ˆœ.In this thesis, a risk-aware motion control scheme is considered for autonomous systems to avoid randomly moving obstacles when the true probability distribution of uncertainty is unknown. We propose a novel model predictive control (MPC) method for motion planning and decision-making that systematically adjusts the safety and conservativeness in an environment with randomly moving obstacles. The key component is the Conditional Value-at-Risk (CVaR), employed to limit the safety risk in the MPC problem. Having the empirical distribution obtained using a limited amount of sample data, Sample Average Approximation (SAA) is applied to compute the safety risk. Furthermore, we propose a method, which limits the risk of unsafety even when the true distribution of the obstacles movements deviates, within an ambiguity set, from the empirical one. By choosing the ambiguity set as a statistical ball with its radius measured by the Wasserstein metric, we achieve a probabilistic guarantee of the out-of-sample risk, evaluated using new sample data generated independently of the training data. A set of reformulations are applied on both SAA-based MPC (SAA-MPC) and Wasserstein Distributionally Robust MPC (DR-MPC) to make them tractable. In addition, we combine the DR-MPC method with Gaussian Process (GP) to predict the future motion of the obstacles from past observations of the environment. The performance of the proposed methods is demonstrated and analyzed through simulation studies using a nonlinear vehicle model and a linearized quadrotor model.๋ณธ ์—ฐ๊ตฌ์—์„œ ์ž์œจ ์‹œ์Šคํ…œ์ด ์•Œ๋ ค์ง€์ง€ ์•Š์€ ํ™•๋ฅ  ๋ถ„ํฌ๋กœ ๋žœ๋คํ•˜๊ฒŒ ์›€์ง์ด๋Š” ์žฅ์• ๋ฌผ์„ ํ”ผํ•˜๊ธฐ ์œ„ํ•œ ์œ„ํ—˜ ์ธ์‹์„ ๊ณ ๋ คํ•˜๋Š” ๋ชจ์…˜ ์ œ์–ด ๊ธฐ๋ฒ•์„ ๊ฐœ๋ฐœํ•œ๋‹ค. ๋”ฐ๋ผ์„œ ๋ณธ ๋…ผ๋ฌธ์—์„œ ์•ˆ์ „์„ฑ๊ณผ ๋ณด์ˆ˜์„ฑ์„ ์ฒด๊ณ„์ ์œผ๋กœ ์กฐ์ ˆํ•˜๋Š” ์ƒˆ๋กœ์šด Model Predictive Control (MPC) ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. ๋ณธ ๋ฐฉ๋ฒ™์˜ ํ•ต์‹ฌ ์š”์†Œ๋Š” MPC ๋ฌธ์ œ์˜ ์•ˆ์ „์„ฑ ๋ฆฌ์Šคํฌ๋ฅผ ์ œํ•œํ•˜๋Š” Conditional Value-at-Risk (CVaR)๋ผ๋Š” ๋ฆฌ์Šคํฌ ์ฒ™๋„์ด๋‹ค. ์•ˆ์ „์„ฑ ๋ฆฌ์Šคํฌ๋ฅผ ๊ณ„์‚ฐํ•˜๊ธฐ ์œ„ํ•ด ์ œํ•œ๋œ ์–‘์˜ ํ‘œ๋ณธ ๋ฐ์ดํ„ฐ๋ฅผ ์ด์šฉํ•˜์—ฌ ์–ป์–ด์ง„ ๊ฒฝํ—˜์  ๋ถ„ํฌ๋ฅผ ์‚ฌ์šฉํ•˜๋Š” Sample Average Approximation (SAA)์„ ์ ์šฉํ•œ๋‹ค. ๋˜ํ•œ, ๊ฒฝํ—˜์  ๋ถ„ํฌ๋กœ๋ถ€ํ„ฐ ์‹ค์ œ ๋ถ„ํฌ๊ฐ€ Ambiguity Set๋ผ๋Š” ์ง‘ํ•ฉ ๋‚ด์—์„œ ๋ฒ—์–ด๋‚˜๋„ ๋ฆฌ์Šคํฌ๋ฅผ ์ œํ•œํ•˜๋Š” ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•œ๋‹ค. Ambiguity Set๋ฅผ Wasserstein ๊ฑฐ๋ฆฌ๋กœ ์ธก์ •๋œ ๋ฐ˜์ง€๋ฆ„์„ ๊ฐ€์ง„ ํ†ต๊ณ„์  ๊ณต์œผ๋กœ ์„ ํƒํ•จ์œผ๋กœ์จ ํ›ˆ๋ จ ๋ฐ์ดํ„ฐ์™€ ๋…๋ฆฝ์ ์œผ๋กœ ์ƒ์„ฑ๋œ ์ƒˆ๋กœ์šด ์ƒ˜ํ”Œ ๋ฐ์ดํ„ฐ๋ฅผ ์‚ฌ์šฉํ•˜์—ฌ ํ‰๊ฐ€ํ•œ out-of-sample risk์— ๋Œ€ํ•œ ํ™•๋ฅ ์  ๋ณด์žฅ์„ ๋‹ฌ์„ฑํ•œ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ SAA๊ธฐ๋ฐ˜ MPC (SAA-MPC)์™€ Wasserstein Distributionally Robust MPC (DR-MPC)๋ฅผ ์—ฌ๋Ÿฌ ๊ณผ์ •์„ ํ†ตํ•˜์—ฌ ๋‹ค๋ฃจ๊ธฐ ์‰ฌ์šด ํ”„๋กœ๊ทธ๋žจ์œผ๋กœ ์žฌํŽธ์„ฑํ•œ๋‹ค. ๋˜ํ•œ, ํ™˜๊ฒฝ์˜ ๊ณผ๊ฑฐ ๊ด€์ธก์œผ๋กœ๋ถ€ํ„ฐ ์žฅ์• ๋ฌผ์˜ ๋ฏธ๋ž˜ ์›€์ง์ž„์„ ์˜ˆ์ธกํ•˜๊ธฐ ์œ„ํ•ด Distributionally Robust MPC ๋ฐฉ๋ฒ•์„ Gaussian Process (GP)์™€ ๊ฒฐํ•ฉํ•œ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ ๊ฐœ๋ฐœ๋˜๋Š” ๊ธฐ๋ฒ•๋“ค์˜ ์„ฑ๋Šฅ์„ ๋น„์„ ํ˜• ์ž๋™์ฐจ ๋ชจ๋ธ๊ณผ ์„ ํ˜•ํ™”๋œ ์ฟผ๋“œ๋กœํ„ฐ ๋ชจ๋ธ์„ ์ด์šฉํ•œ ์‹œ๋ฎฌ๋ ˆ์ด์…˜ ์—ฐ๊ตฌ๋ฅผ ํ†ตํ•˜์—ฌ ๋ถ„์„ํ•œ๋‹ค.1 BACKGROUND AND OBJECTIVES 1 1.1 Motivation and Objectives 1 1.2 Research Contributions 2 1.3 Thesis Organization 3 2 RISK-AWARE MOTION PLANNING AND CONTROL USING CVAR-CONSTRAINED OPTIMIZATION 5 2.1 Introduction 5 2.2 System and Obstacle Models 8 2.3 CVaR-constrained Motion Planning and Control 10 2.3.1 Reference Trajectory Planning 10 2.3.2 Safety Risk 11 2.3.3 Risk-Constrained Model Predictive Control 13 2.3.4 Linearly Constrained Mixed Integer Convex Program 18 2.4 Numerical Experiments 20 2.4.1 Effect of Confidence Level 21 2.4.2 Effect of Sample Size 23 2.5 Conclusions 24 3 WASSERSTEIN DISTRIBUTIONALLY ROBUST MPC 28 3.1 Introduction 28 3.2 System and Obstacle Models 31 3.3 Wasserstein Distributionally Robust MPC 33 3.3.1 Distance to the Safe Region 36 3.3.2 Reformulation of Distributionally Robust Risk Constraint 38 3.3.3 Reformulation of the Wasserstein DR-MPC Problem 43 3.4 Out-of-Sample Performance Guarantee 45 3.5 Numerical Experiments 47 3.5.1 Nonlinear Car-Like Vehicle Model 48 3.5.2 Linearized Quadrotor Model 53 3.6 Conclusions 57 4 LEARNING-BASED DISTRIBUTIONALLY ROBUST MPC 58 4.1 Introduction 58 4.2 Learning the Movement of Obstacles Using Gaussian Processes 60 4.2.1 Obstacle Model 60 4.2.2 Gaussian Process Regression 61 4.2.3 Prediction of the Obstacle's Motion 63 4.3 Gaussian Process based Wasserstein DR-MPC 65 4.4 Numerical Experiments 70 4.5 Conclusions 74 5 CONCLUSIONS AND FUTURE WORK 75 Abstract (In Korean) 87Maste
    • โ€ฆ
    corecore