209 research outputs found

    ๊ฐ€๋ณ€ ํ† ํด๋กœ์ง€ ํŠธ๋Ÿฌ์Šค ๋กœ๋ด‡์˜ ์•ˆ์ •์ ์ธ ์ฃผํ–‰ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๊ฐœ๋ฐœ

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ๊ธฐ๊ณ„๊ณตํ•™๊ณผ, 2020. 8. ๊น€์ข…์›.Variable Topology Truss (VTT) is truss structured modular robot that can self-reconfigure its topology and geometric configuration, which can be usefully applied to rescuing work in disaster site. In this thesis, design of VTT is introduced and stable rolling locomotion algorithm for VTT is proposed. To achieve self-reconfiguration feature, VTT are composed specially designed members and nodes. VTTs members consist of Spiral Zippers which are novel linear actuators that has high extension ratio, light weight and high strength. VTTs nodes consist of Passive Member-Ends and Master Member-Ends. Passive Member-Ends are linkage type spherical joint with large angle range that can accommodate many members. Master Member-Ends are spherical manipulators that built in Sphere and it move member to change topology of VTT. Rolling locomotion of VTT is achieved by controlling the center of mass by geometric reconfiguration. However, the locomotion planning is complex problem, because VTT is parallel mechanism with high degree of freedom and many constraints, which makes it difficult to predict and avoid constraints for feasible planning. Thus, it needs stable algorithm that can find locomotion trajectory even in complicated and large environment. In addition, since VTT has many sophisticated components, the algorithm must prevent VTT being damaged from ground by tumbling. To meet the requirements, proposed locomotion algorithm is composed of 3 steps; support polygon planning, center of mass planning and node position planning. In support polygon planning, support polygon path is planned by newly proposed random search algorithm, Polygon-Based Random Tree (PRT). In center of mass planning, trajectory of desired projected center of mass is planned by maximizing stability feature. Planned support polygon path and center of mass trajectory guide VTT to have good-conditioned shape which configuration is far from constraints and makes locomotion planning success even in complex and large environment. In node position planning, Non-Impact Rolling locomotion algorithm was developed to plan position of VTTs nodes that prevent damage from the ground while following planned support polygon path and center of mass trajectory. The algorithm was verified by two case study. In case study 1, locomotion planning and simulation was performed considering actual constraints of VTT. To avoid collision between VTT and obstacle, safety space was defined and considered in support polygon planning. The result shows that VTT successfully reaches the goal while avoiding obstacles and satisfying constraints. In case study 2, locomotion planning and simulation was performed in the environment having wide space and narrow passage. Nominal length of VTT was set to be large in wide space to move efficiently, and set to be small in narrow passage to pass through it. The result shows that VTT successfully reaches the goal while changing its nominal length in different terrain.๊ฐ€๋ณ€ ํ† ํด๋กœ์ง€ ํŠธ๋Ÿฌ์Šค (Variable Topology Truss, VTT)๋Š” ํ† ํด๋กœ์ง€์™€ ๊ธฐํ•˜ํ•™์  ํ˜•์ƒ์˜ ์žฌ๊ตฌ์„ฑ์ด ๊ฐ€๋Šฅํ•œ ํŠธ๋Ÿฌ์Šค ๊ตฌ์กฐ์˜ ๋ชจ๋“ˆ ๋กœ๋ด‡์ด๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” VTT์˜ ์„ค๊ณ„ ๊ตฌ์กฐ๋ฅผ ์†Œ๊ฐœํ•˜๊ณ  VTT์˜ ์•ˆ์ •์ ์ธ ์ฃผํ–‰์„ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์•ˆํ•œ๋‹ค. VTT๋Š” ํ† ํด๋กœ์ง€์™€ ๊ธฐํ•˜ํ•™์  ํ˜•์ƒ์˜ ์žฌ๊ตฌ์„ฑ์„ ์œ„ํ•ด ํŠน์ˆ˜ํ•œ ๊ตฌ์กฐ์˜ ๋ฉค๋ฒ„์™€ ๋…ธ๋“œ๋ฅผ ๊ฐ€์ง„๋‹ค. VTT์˜ ๋ฉค๋ฒ„๋Š” ๋†’์€ ์••์ถ•๋น„, ๊ฐ€๋ฒผ์šด ์ค‘๋Ÿ‰, ๋†’์€ ๊ฐ•๋„๋ฅผ ๊ฐ€์ง„ ์‹ ๊ฐœ๋… ์„ ํ˜• ๊ตฌ๋™๊ธฐ์ธ ์ŠคํŒŒ์ด๋Ÿด ์ง€ํผ๋กœ ๊ตฌ์„ฑ๋˜์–ด ์žˆ๋‹ค. VTT์˜ ๋…ธ๋“œ๋Š” ํŒจ์‹œ๋ธŒ ๋ฉค๋ฒ„ ์—”๋“œ์™€ ๋งˆ์Šคํ„ฐ ์—”๋“œ๋กœ ๊ตฌ์„ฑ๋˜์–ด ์žˆ๋‹ค. ํŒจ์‹œ๋ธŒ ๋ฉค๋ฒ„๋Š” ๋งํ‚ค์ง€ ๊ตฌ์กฐ์˜ 3 ์ž์œ ๋„ ๊ด€์ ˆ๋กœ, ๋„“์€ ๊ฐ๋„ ๊ตฌ๋™ ๋ฒ”์œ„๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ๊ณ  ๋งŽ์€ ์ˆ˜์˜ ๋ฉค๋ฒ„๋ฅผ ์—ฐ๊ฒฐํ•  ์ˆ˜ ์žˆ๋‹ค. ๋งˆ์Šคํ„ฐ ๋ฉค๋ฒ„ ์—”๋“œ๋Š” ๋…ธ๋“œ ๋ถ€์˜ ๋‚ด์žฅ๋œ ๊ตฌํ˜• ๋งค๋‹ˆํ“ฐ๋ ˆ์ดํ„ฐ๋กœ, ํ† ํด๋กœ์ง€ ์žฌ๊ตฌ์„ฑ ์‹œ ๋ฉค๋ฒ„๋ฅผ ์ด๋™์‹œํ‚ค๋Š”๋ฐ ์‚ฌ์šฉ๋œ๋‹ค. VTT๋Š” ๊ธฐํ•˜ํ•™์  ํ˜•์ƒ์„ ๋ณ€ํ™”ํ•˜์—ฌ ๊ตฌ๋ฅด๋Š” ์›€์ง์ž„์„ ํ†ตํ•ด ์ฃผํ–‰ํ•œ๋‹ค. VTT์˜ ์ฃผํ–‰ ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ ์„œํฌํŠธ ํด๋ฆฌ๊ณค ๊ณ„ํš ๋‹จ๊ณ„, ๋ฌด๊ฒŒ ์ค‘์‹ฌ ๊ณ„ํš ๋‹จ๊ณ„, ๋…ธ๋“œ ์œ„์น˜ ๊ณ„ํš ๋‹จ๊ณ„๋กœ ์ด๋ฃจ์–ด์ง„๋‹ค. ์„œํฌํŠธ ํด๋ฆฌ๊ณค ๊ณ„ํš ๋‹จ๊ณ„์—์„œ๋Š” ์ƒˆ๋กญ๊ฒŒ ์ œ์•ˆ๋œ ๋ฌด์ž‘์œ„ ํƒ์ƒ‰ (random search) ์•Œ๊ณ ๋ฆฌ์ฆ˜์ธ Polygon-Based Random Tree (PRT)์„ ์ ์šฉํ•ด ์„œํฌํŠธ ํด๋ฆฌ๊ณค์˜ ๊ฒฝ๋กœ๋ฅผ ๊ณ„ํšํ•œ๋‹ค. ๋ฌด๊ฒŒ ์ค‘์‹ฌ ๊ณ„ํš ๋‹จ๊ณ„์—์„œ๋Š” ์•ˆ์ •์„ฑ์„ ์ตœ๋Œ€ํ™”ํ•˜๋Š” VTT์˜ ๋ฌด๊ฒŒ ์ค‘์‹ฌ ๊ถค์ ์„ ๊ณ„ํšํ•œ๋‹ค. ๊ณ„ํš๋œ ์„œํฌํŠธ ํด๋ฆฌ๊ณค ๊ฒฝ๋กœ์™€ ๋ฌด๊ฒŒ ์ค‘์‹ฌ ๊ถค์ ์„ VTT๊ฐ€ ์ œํ•œ ์กฐ๊ฑด์œผ๋กœ๋ถ€ํ„ฐ ๋จผ ์ข‹์€ ์ƒํƒœ์˜ ํ˜•์ƒ์„ ์œ ์ง€ํ•˜๊ฒŒ ํ•˜์—ฌ ๋ณต์žกํ•œ ํ™˜๊ฒฝ์— ๋Œ€ํ•ด์„œ๋„ ๊ฒฝ๋กœ ๊ณ„ํš์ด ์‹คํŒจํ•˜์ง€ ์•Š๊ณ  ์•ˆ์ •์ ์œผ๋กœ ์ด๋ฃจ์–ด์งˆ ์ˆ˜ ์žˆ๋„๋ก ํ•œ๋‹ค. ๋…ธ๋“œ ์œ„์น˜ ๊ณ„ํš ๋‹จ๊ณ„์—์„œ๋Š” ์„œํฌํŠธ ํด๋ฆฌ๊ณค ๊ฒฝ๋กœ์™€ ๋…ธ๋“œ ์œ„์น˜์˜ ๊ถค์ ์„ ์ถ”์ข…ํ•˜๋Š” ๋…ธ๋“œ ์œ„์น˜ ๊ถค์ ์„ ๊ณ„ํšํ•œ๋‹ค. ์ด ๊ณผ์ •์—์„œ ๋น„์ถฉ๊ฒฉ ๋กค๋ง ์ด๋™ ์•Œ๊ณ ๋ฆฌ์ฆ˜ (Non-Impact Rolling locomotion algorithm)์„ ์ ์šฉํ•˜์—ฌ ์ง€๋ฉด๊ณผ์˜ ์ถฉ๋Œ๋กœ ์ธํ•œ ์ถฉ๊ฒฉ์ด ์ผ์–ด๋‚˜์ง€ ์•Š๋Š” ๊ถค์ ์„ ๊ณ„ํšํ•œ๋‹ค. ์‹ค์ œ VTT์˜ ์ œํ•œ ์กฐ๊ฑด์„ ๋ฐ˜์˜ํ•œ ๋ชจ๋ธ์— ๋ณธ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ ์šฉํ•˜์—ฌ ์‹œ๋ฎฌ๋ ˆ์ด์…˜์„ ์ˆ˜ํ–‰ํ•œ ๊ฒฐ๊ณผ, VTT๊ฐ€ ๋ชจ๋“  ์ œํ•œ ์กฐ๊ฑด์„ ๋งŒ์กฑํ•˜๊ณ  ์žฅ์• ๋ฌผ์„ ํšŒํ”ผํ•˜๋ฉด์„œ ๋ชฉํ‘œ ์ง€์ ์— ๋„๋‹ฌํ•  ์ˆ˜ ์žˆ์Œ์„ ํ™•์ธํ•˜์˜€๋‹ค.Chapter 1. Introduction 1 1.1 Motivation 1 1.2 Previous Truss Type Modular Robot 4 1.3 Previous Research on VTTs Locomotion 8 1.3.1 Heuristic Based Methods 9 1.3.2 Optimization Based Method 10 1.4 Objectives of Locomotion Algorithm 12 1.5 Contribution of Thesis 13 1.5.1 Introduction to Hardware Design of VTT 13 1.5.2 Stable Rolling Locomotion of VTT 15 Chapter 2. Design of Variable Topology Truss 17 2.1 Member Design 18 2.1.1 Spiral Zipper 20 2.1.2 Tensioner 26 2.2 Node Design 28 2.2.1 Passive Member-End and Sphere 29 2.2.2 Master Member-End 36 2.3 Control System 40 2.4 Node Position Control Experiment 44 Chapter 3. Mathematical Model of Variable Topology Truss 47 3.1 Configuration and Terminology 47 3.2 Inverse Kinematics 50 3.3 Constraints 51 3.4 Stability Criteria 64 Chapter 4. Locomotion Algorithm 66 4.1 Concept of Locomotion Algorithm 67 4.1.1 Method for Successful Planning and Obstacle Avoidance 67 4.1.2 Method to Prevent Damage from the Ground 71 4.1.3 Step of Locomotion Algorithm 72 4.2 Support Polygon Planning 73 4.2.1 Polygon-Based Random Tree (PRT) Algorithm 73 4.2.2 Probabilistic Completeness of PRT Algorithm 79 4.3 Center of Mass Planning 85 4.4 Node Position Planning 86 4.4.1 Concept of Non-Impact Rolling Locomotion 86 4.4.2 Planning Algorithm for Non-Impact Rolling Locomotion 89 4.4.3 Optimization Problem of Moving Phase 94 4.4.4 Optimization Problem of Landing Phase 98 4.4.5 Optimization Problem of Transient Phase 99 Chapter 5. Experimental Verification 100 5.1 Case Study 1: Actual VTT Prototype 101 5.1.1 Simulation Condition 101 5.1.2 Obstacle Avoidance Method 103 5.1.3 Simulation Result 104 5.2 Case Study 2: Environment with Narrow Passage 111 5.2.1 Simulation Condition 111 5.2.2 Support Polygon Planning with Varying Nominal Length 114 5.2.3 Simulation Result 117 Chapter 6. Conclusion 126 Bibliography 129 Abstract in Korean 134Docto

    Motion Planning for Variable Topology Trusses: Reconfiguration and Locomotion

    Full text link
    Truss robots are highly redundant parallel robotic systems that can be applied in a variety of scenarios. The variable topology truss (VTT) is a class of modular truss robots. As self-reconfigurable modular robots, a VTT is composed of many edge modules that can be rearranged into various structures depending on the task. These robots change their shape by not only controlling joint positions as with fixed morphology robots, but also reconfiguring the connectivity between truss members in order to change their topology. The motion planning problem for VTT robots is difficult due to their varying morphology, high dimensionality, the high likelihood for self-collision, and complex motion constraints. In this paper, a new motion planning framework to dramatically alter the structure of a VTT is presented. It can also be used to solve locomotion tasks that are much more efficient compared with previous work. Several test scenarios are used to show its effectiveness. Supplementary materials are available at https://www.modlabupenn.org/vtt-motion-planning/.Comment: 20 pages, 36 figure

    Modular Robots Morphology Transformation And Task Execution

    Get PDF
    Self-reconfigurable modular robots are composed of a small set of modules with uniform docking interfaces. Different from conventional robots that are custom-built and optimized for specific tasks, modular robots are able to adapt to many different activities and handle hardware and software failures by rearranging their components. This reconfiguration capability allows these systems to exist in a variety of morphologies, and the introduced flexibility enables self-reconfigurable modular robots to handle a much wider range of tasks, but also complicates the design, control, and planning. This thesis considers a hierarchy framework to deploy modular robots in the real world: the robot first identifies its current morphology, then reconfigures itself into a new morphology if needed, and finally executes either manipulation or locomotion tasks. A reliable system architecture is necessary to handle a large number of modules. The number of possible morphologies constructed by modules increases exponentially as the number of modules grows, and these morphologies usually have many degrees of freedom with complex constraints. In this thesis, hardware platforms and several control methods and planning algorithms are developed to build this hierarchy framework leading to the system-level deployment of modular robots, including a hybrid modular robot (SMORES-EP) and a modular truss robot (VTT). Graph representations of modular robots are introduced as well as several algorithms for morphology identification. Efficient mobile-stylereconfiguration strategies are explored for hybrid modular robots, and a real-time planner based on optimal control is developed to perform dexterous manipulation tasks. For modular truss robots, configuration space is studied and a hybrid planning framework (sampling-based and search-based) is presented to handle reconfiguration activities. A non-impact rolling locomotion planner is then developed to drive an arbitrary truss robot in an environment

    Scalable and Probabilistically Complete Planning for Robotic Spatial Extrusion

    Full text link
    There is increasing demand for automated systems that can fabricate 3D structures. Robotic spatial extrusion has become an attractive alternative to traditional layer-based 3D printing due to a manipulator's flexibility to print large, directionally-dependent structures. However, existing extrusion planning algorithms require a substantial amount of human input, do not scale to large instances, and lack theoretical guarantees. In this work, we present a rigorous formalization of robotic spatial extrusion planning and provide several efficient and probabilistically complete planning algorithms. The key planning challenge is, throughout the printing process, satisfying both stiffness constraints that limit the deformation of the structure and geometric constraints that ensure the robot does not collide with the structure. We show that, although these constraints often conflict with each other, a greedy backward state-space search guided by a stiffness-aware heuristic is able to successfully balance both constraints. We empirically compare our methods on a benchmark of over 40 simulated extrusion problems. Finally, we apply our approach to 3 real-world extrusion problems

    Computer-Aided Geometry Modeling

    Get PDF
    Techniques in computer-aided geometry modeling and their application are addressed. Mathematical modeling, solid geometry models, management of geometric data, development of geometry standards, and interactive and graphic procedures are discussed. The applications include aeronautical and aerospace structures design, fluid flow modeling, and gas turbine design

    Third International Symposium on Artificial Intelligence, Robotics, and Automation for Space 1994

    Get PDF
    The Third International Symposium on Artificial Intelligence, Robotics, and Automation for Space (i-SAIRAS 94), held October 18-20, 1994, in Pasadena, California, was jointly sponsored by NASA, ESA, and Japan's National Space Development Agency, and was hosted by the Jet Propulsion Laboratory (JPL) of the California Institute of Technology. i-SAIRAS 94 featured presentations covering a variety of technical and programmatic topics, ranging from underlying basic technology to specific applications of artificial intelligence and robotics to space missions. i-SAIRAS 94 featured a special workshop on planning and scheduling and provided scientists, engineers, and managers with the opportunity to exchange theoretical ideas, practical results, and program plans in such areas as space mission control, space vehicle processing, data analysis, autonomous spacecraft, space robots and rovers, satellite servicing, and intelligent instruments

    Proceedings of the NASA Conference on Space Telerobotics, volume 1

    Get PDF
    The theme of the Conference was man-machine collaboration in space. Topics addressed include: redundant manipulators; man-machine systems; telerobot architecture; remote sensing and planning; navigation; neural networks; fundamental AI research; and reasoning under uncertainty

    Geometric representations for conceptual design using evolutionary algorithms

    Get PDF
    Civil engineering design problems are typically approached using traditional techniques i.e. deterministic algorithms, rather than via stochastic search such as evolutionary algorithms. However evolutionary algorithms are adept at exploring fragmented and complex search spaces, such as those found in design, but do require potential solutions to have a 'representation' amenable to evolutionary operators. Four canonical representations have been proposed including: strings (generally used for parameter based problems), voxels (shape discovery), trees and graphs (skeletal structures). Several authors have proposed design algorithms for the conceptual layout design of commercial office buildings but all are limited to buildings with rectangular floor plans. This thesis presents an evolutionary algorithm based methodology capable of representing buildings with orthogonal boundaries and atria by using a 3-section string with real encoding, which ensures the initialisation and evolutionary operations are not too disruptive on column alignments encoded via the genome. In order to handle orthogonal layouts polygon- partitioning techniques are used to decompose them into rectangular sections, which can be solved individually. However to prevent the layout becoming too discontinuous, an 'adjacency graph' is proposed which ensures column line continuity throughout the building. Dome geometric layout design is difficult, because every joint and member must be located on the external surface and not impinge on the internal void. This thesis describes a string-based representation capable of designing directly in 3D using surface area and enclosed volume as the major search parameters. The representation encodes support and joint positions, which are converted into a dome by constructing its corresponding convex hull. Once constructed the hull's edges become the structural members and its vertices the joints. This avoids many of the problems experienced by the previous approach, which suffers when restrictive constraints such as the requirement to maintain l/8th symmetry are removed. The aim of this thesis is to investigate how some civil engineering design problems, in particular structures, can be represented using evolutionary algorithms (EA) and contains two, independent experimental chapters on building layout design and geometric dome design (an introduction to EAs and design is also provided). Civil engineering design problems are typically approached using traditional techniques i.e. deterministic algorithms, rather than via stochastic search such as EAs. However EAs are adept at exploring fragmented and complex search spaces, such as those found in design, but do require potential solutions to have a 'representation' amenable to evolutionary operators. Four canonical representations have been proposed including: strings (generally used for parameter based problems), voxels (shape discovery), trees and graphs (skeletal structures). Several authors have proposed design algorithms for the conceptual layout design of commercial office buildings but all are limited to buildings with rectangular floor plans. This thesis presents an evolutionary algorithm based methodology capable of representing buildings with orthogonal boundaries and atria by using a 3-section string with real encoding, which ensures the initialisation and evolutionary operations are not too disruptive on column alignments encoded via the genome. In order to handle orthogonal layouts polygon- partitioning techniques are used to decompose them into rectangular sections, which can be solved individually. However to prevent the layout becoming too discontinuous, an 'adjacency graph' is proposed which ensures column line continuity throughout the building. Dome geometric layout design is difficult, because every joint and member must be located on the external surface and not impinge on the internal void. This thesis describes a string-based representation capable of designing directly in 3D using surface area and enclosed volume as the major search parameters. The representation encodes support and joint positions, which are converted into a dome by constructing its corresponding convex hull. Once constructed the hull's edges become the structural members and its vertices the joints. This avoids many of the problems experienced by the previous approach, which suffers th when restrictive constraints such as the requirement to maintain 1/8 symmetry are removed

    Path and Motion Planning for Autonomous Mobile 3D Printing

    Get PDF
    Autonomous robotic construction was envisioned as early as the โ€˜90s, and yet, con- struction sites today look much alike ones half a century ago. Meanwhile, highly automated and efficient fabrication methods like Additive Manufacturing, or 3D Printing, have seen great success in conventional production. However, existing efforts to transfer printing technology to construction applications mainly rely on manufacturing-like machines and fail to utilise the capabilities of modern robotics. This thesis considers using Mobile Manipulator robots to perform large-scale Additive Manufacturing tasks. Comprised of an articulated arm and a mobile base, Mobile Manipulators, are unique in their simultaneous mobility and agility, which enables printing-in-motion, or Mobile 3D Printing. This is a 3D printing modality, where a robot deposits material along larger-than-self trajectories while in motion. Despite profound potential advantages over existing static manufacturing-like large- scale printers, Mobile 3D printing is underexplored. Therefore, this thesis tack- les Mobile 3D printing-specific challenges and proposes path and motion planning methodologies that allow this printing modality to be realised. The work details the development of Task-Consistent Path Planning that solves the problem of find- ing a valid robot-base path needed to print larger-than-self trajectories. A motion planning and control strategy is then proposed, utilising the robot-base paths found to inform an optimisation-based whole-body motion controller. Several Mobile 3D Printing robot prototypes are built throughout this work, and the overall path and motion planning strategy proposed is holistically evaluated in a series of large-scale 3D printing experiments
    • โ€ฆ
    corecore