• 제목/요약/키워드: Coverage Path Planning

검색결과 25건 처리시간 0.028초

Flow Network 을 이용한 자율 청소로봇의 전영역 경로 계획 (Complete Coverage Path Planning for Autonomous Cleaning Robot using Flow Network)

  • 남상현;문승빈
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2003년도 추계학술발표논문집 (중)
    • /
    • pp.639-642
    • /
    • 2003
  • 본 논문에서는 청소로봇이 전 청소 영역을 CCPP(Complete Coverage Path Planning)를 이용해 경로를 생성한 후 재 경로계획 시 장애물의 미소한 변화로도 기존에 생성한 전 경로패턴을 바꾸지 않고 수정 할 수 있는 CD(Cell Decomposition)와 FN(Flow Network)을 이용한 CCPP 방식을 제안 하였다. 그리고 제안된 경로 계획에 대해 시뮬레이션으로 결과를 제시하였다.

  • PDF

도시환경 매핑 시 SLAM 불확실성 최소화를 위한 강화 학습 기반 경로 계획법 (RL-based Path Planning for SLAM Uncertainty Minimization in Urban Mapping)

  • 조영훈;김아영
    • 로봇학회논문지
    • /
    • 제16권2호
    • /
    • pp.122-129
    • /
    • 2021
  • For the Simultaneous Localization and Mapping (SLAM) problem, a different path results in different SLAM results. Usually, SLAM follows a trail of input data. Active SLAM, which determines where to sense for the next step, can suggest a better path for a better SLAM result during the data acquisition step. In this paper, we will use reinforcement learning to find where to perceive. By assigning entire target area coverage to a goal and uncertainty as a negative reward, the reinforcement learning network finds an optimal path to minimize trajectory uncertainty and maximize map coverage. However, most active SLAM researches are performed in indoor or aerial environments where robots can move in every direction. In the urban environment, vehicles only can move following road structure and traffic rules. Graph structure can efficiently express road environment, considering crossroads and streets as nodes and edges, respectively. In this paper, we propose a novel method to find optimal SLAM path using graph structure and reinforcement learning technique.

Complete Coverage Path Planning of Cleaning Robot

  • 유강;김갑일;손영익
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.429-432
    • /
    • 2003
  • In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

  • PDF

Study on Path Planning Algorithms for Unmanned Agricultural Helicopters in Complex Environment

  • Moon, Sang-Woo;Shim, David Hyun-Chul
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제10권2호
    • /
    • pp.1-11
    • /
    • 2009
  • In this paper, two algorithms to solve the path planning problem with constraints from obstacles are presented. One proposed Algorithm is "Grid point-based path planning". The first step of this algorithm is to set points which can be the waypoints around the field. These points can be located inside or outside of the field or the obstacles. Therefore, we should determine whether those points are located in the field or not. Using the equations of boundary lines for a region that we are interested in is an effective approach to handle. The other algorithm is based on the boundary lines of the agricultural field, and the concept of this algorithm is well known as "boustrophedon method". These proposed algorithms are simple but powerful for complex cases since it can generate a plausible path for the complex shape which cannot be represented by using geometrical approaches efficiently and for the case that some obstacles or forbidden regions are located on the field by using a skill of discriminants about set points. As will be presented, this proposed algorithm could exhibit a reasonable accuracy to perform an agricultural mission.

다중 무인 항공기 이용 감시 및 탐색 경로 계획 생성 (Path Planning for Search and Surveillance of Multiple Unmanned Aerial Vehicles )

  • 이산하;정원모;김명건;이상필;이충희;김신구;손흥선
    • 로봇학회논문지
    • /
    • 제18권1호
    • /
    • pp.1-9
    • /
    • 2023
  • This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

GIS를 기반으로 한 CT-2 서비스 영역 예측 및 셀설계 시뮬레이터 개발 (Development of a Simulator for CT-2 Coverage Prediction and Cell Planning by GIS-Based Approach)

  • 임종수;이봉석;이문수
    • 한국정보처리학회논문지
    • /
    • 제6권5호
    • /
    • pp.1342-1350
    • /
    • 1999
  • A new design procedure for micro cellular coverage prediction is presented here on this paper, which contains a new propagation analysis algorithm based on processing of vector data representing roads and buildings which mainly affect the propagation phenomena in micro-cell environments. The propagation analysis algorithm presented here has been developed to aim at the practical application for micro-cellular systems such as PCS or CE-2. As all the vectors used here are of closed poly lines, i.e., polygons, a simplified ray path search technique can be developed not only to determine if the calculation points are on the road polygons and but also to calculate the amount of blockage by buildings. The result shows a capability of predicting path loss with an RMS error of 5dB or lower.

  • PDF

Development of a Path Generation and Tracking Algorithm for a Korean Auto-guidance Tillage Tractor

  • Han, Xiong-Zhe;Kim, Hak-Jin;Moon, Hee-Chang;Woo, Hoon-Je;Kim, Jung-Hun;Kim, Young-Joo
    • Journal of Biosystems Engineering
    • /
    • 제38권1호
    • /
    • pp.1-8
    • /
    • 2013
  • Purpose: Path planning and tracking algorithms applicable to various agricultural operations, such as tillage, planting, and spraying, are needed to generate steering angles for auto-guidance tractors to track a point ahead on the path. An optimal coverage path algorithm can enable a vehicle to effectively travel across a field by following a sequence of parallel paths with fixed spacing. This study proposes a path generation and tracking algorithm for an auto-guided Korean tractor with a tillage implement that generates a path with C-type turns and follows the generated path in a paddy field. A mathematical model was developed to generate a waypoint path for a tractor in a field. This waypoint path generation model was based on minimum tractor turning radius, waypoint intervals and LBOs (Limit of Boundary Offsets). At each location, the steering angle was calculated by comparing the waypoint angle and heading angle of the tractor. A path following program was developed with Labview-CVI to automatically read the waypoints and generate steering angles for the tractor to proceed to the next waypoint. A feasibility test of the developed program for real-time path tracking was performed with a mobile platform traveling on flat ground. The test results showed that the developed algorithm generated the desired path and steering angles with acceptable accuracy.

UAV 감시정보정찰 임무분석 및 설계 도구 개발 (Development of Mission Analysis and Design Tool for ISR UAV Mission Planning)

  • 김홍래;전병일;이나래;최성동;장영근
    • 한국항공우주학회지
    • /
    • 제42권2호
    • /
    • pp.181-190
    • /
    • 2014
  • 무인항공기(UAV)를 이용하여 효율적인 감시정찰을 수행하기 위해서는 센서의 고성능, 다중화와 함께 운용상황에 맞는 최적화된 비행경로계획이 요구된다. 이뿐만 아니라 시스템 개발 또는 임무운용 전 임무 효용성 평가, 평시와 전시에 빠른 작전 결정을 위해서는 임무를 가시화할 수 있는 가시화 도구가 필요하다. 본 연구에서는 STK(Systems Tool Kit)와 MATLAB을 통합한 임무 가시화 및 분석 도구를 개발하고 이를 통하여 UAV 감시정보정찰(ISR; Intelligence, Surveillance and Reconnaissance) 임무분석을 수행하였다. 개발된 임무분석 도구에는 비행최적화 뿐만 아니라 장애물 회피 알고리즘, FoM(Figure of Merit) 분석 알고리즘이 적용되어 최적의 임무계획이 가능하도록 하였다.

자율 청소 로봇을 위한 미지의 환경에서의 새로운 경로 계획 방법 (A New Solution to Path Planning of Autonomous Cleaning Robot in Unknown Environment)

  • 이상수;오준섭;박진배;최윤호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 D
    • /
    • pp.2335-2337
    • /
    • 2001
  • In this paper, we address a new complete coverage navigation algorithm and guidance methodology for the cleaning robot. The proposed algorithm is based on the grid map. Six templates, excluding a Back-Trace(BT) template are used as the local navigation method. The effectiveness of the algorithm proposed in this paper is thoroughly demonstrated through simulations and the evaluation of parameters for the path execution.

  • PDF

인공지능과 자율운용 기술을 이용한 긴급형 이동통신 기지국 자율설정 및 최적화 (Rapid Self-Configuration and Optimization of Mobile Communication Network Base Station using Artificial Intelligent and SON Technology)

  • 김재정;이희준;지승환
    • 한국정보통신학회논문지
    • /
    • 제26권9호
    • /
    • pp.1357-1366
    • /
    • 2022
  • 긴급 상황에 대비하는 재난망이나 전술 이동통신 네트워크는 현장에 적응하여 신속하고 정확하게 구축하는 것이 중요하다. 전통적인 무선통신 시스템을 구성하기 위해서는 셀 플래닝 장비를 통해 기지국의 파라미터를 설정한다. 하지만 셀 플래닝을 위해서는 환경에 대한 정보나 데이터가 사전에 구축되어 있어야 하며, 셀 플래닝에 반영되지 않아 현장에 맞지 않는 파라미터가 사용되면 네트워크 구축 후 문제의 해결 및 성능 향상을 위해서 별도의 최적화가 진행되어야 한다. 이 논문에서는 이동통신 기지국에서의 인공지능(AI)과 자율운용(SON) 기술을 사용한 신속한 이동통신망 구축 및 최적화 방법을 제시한다. 기지국의 위치와 단말의 측정 정보를 이용한 DNN 모델을 통해 경로 손실 예측을 수행하여 지형을 구분하는 CNN 모델을 기지국 파라미터를 자동으로 설정한 후, 운용 중에 수집되는 데이터로 경로 손실 모델을 학습시키며 이를 이용해 Coverage/Capacity 최적화를 지속적으로 수행할 수 있도록 한다.