Three-Dimensional Path Planning: Navigating through Rough Mereology
Preprint
Abstract
In this paper, we present an innovative technique for the path planning of flying robots in a 3D environment in Rough Mereology terms. The main goal was to construct the algorithm that would generate the mereological potential fields in 3-dimensional space. To avoid falling into the local minimum, we assist with a weighted Euclidean distance. Moreover, a searching path from the start point to the target, with respect to avoiding the obstacles was applied. The environment was created by connecting two cameras working in real-time. To determine the gate and elements of the world inside the map was responsible the Python Library OpenCV [1] which recognized shapes and colors. The main purpose of this paper is to apply the given results to drones.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Navigational Strategies for Mobile Robots Using Rough Mereological Potential Fields and Weighted Distance to Goal2023
- A Framework for Multiagent Mobile Robotics: Spatial Reasoning Based on Rough Mereology in Player/Stage System2008
- Rough mereology: A new paradigm for approximate reasoningInternational Journal of Approximate Reasoning, 1996