Multi-Resolution A*

Heuristic search-based planning techniques are commonly used for motion planning on discretized spaces. The performance of these algorithms is heavily affected by the resolution at which the search space is discretized. Typically a fixed resolution is chosen for a given domain. While a finer resolution allows for better maneuverability, it significantly increases the size of the state space, and hence demands more search efforts. On the contrary, a coarser resolution gives a fast exploratory behavior but compromises on maneuverability and the completeness of the search. To effectively leverage the advantages of both high and low resolution discretizations, we propose Multi-Resolution A* (MRA*) algorithm, that runs multiple weighted-A*(WA*) searches having different resolution levels simultaneously and combines the strengths of all of them. In addition to these searches, MRA* uses one anchor search to control expansions from these searches. We show that MRA* is bounded suboptimal with respect to the anchor resolution search space and resolution complete. We performed experiments on several motion planning domains including 2D, 3D grid planning and 7 DOF manipulation planning and compared our approach with several search-based and sampling-based baselines

Efficient trajectory of a car-like mobile robot

This article is (c) Emerald Group Publishing and permission has been granted for this version to appear here https://riunet.upv.es/. Emerald does not grant permission for this article to be further copied/distributed or hosted elsewhere without the express permission from Emerald Group Publishing Limited.[EN] Purpose The purpose is to create an algorithm that optimizes the trajectories that an autonomous vehicle must follow to reduce its energy consumption and reduce the emission of greenhouse gases. Design/methodology/approach An algorithm is presented that respects the dynamic constraints of the robot, including the characteristics of power delivery by the motor, the behaviour of the tires and the basic inertial parameters. Using quadratic sequential programming with distributed and non-monotonous search direction (Quadratic Programming Algorithm with Distributed and Non-Monotone Line Search), an optimization algorithm proposed and developed by Professor K. Schittkowski is implemented. Findings Relations between important operating variables have been obtained, such as the evolution of the autonomous vehicle's velocity, the driving torque supplied by the engine and the forces acting on the tires. In a subsequent analysis, the aim is to analyse the relationship between trajectory made and energy consumed and calculate the reduction of greenhouse gas emissions. Also this method has been checked against another different methodology commented on in the references. Research limitations/implications The main limitation comes from the modelling that has been done. As greater is the mechanical systems analysed, more simplifying hypotheses should be introduced to solve the corresponding equations with the current computers. However, the solutions are obtained and they can be used qualitatively to draw conclusions. Practical implications One main objective is to obtain guidelines to reduce greenhouse gas emissions by reducing energy consumption in the realization of autonomous vehicles' trajectories. The first step to achieve that is to obtain a good model of the autonomous vehicle that takes into account not only its kinematics but also its dynamic properties, and to propose an optimization process that allows to minimize the energy consumed. In this paper, important relationships between work variables have been obtained. Social implications The idea is to be friendly with nature and the environment. This algorithm can help by reducing an instance of greenhouse gases. Originality/value Originality comes from the fact that we not only look for the autonomous vehicle's modelling, the simulation of its motion and the analysis of its working parameters, but also try to obtain from its working those guidelines that are useful to reduce the energy consumed and the contamination capability of these autonomous vehicles or car-like robots.Valero Chuliá, FJ.; Rubio Montoya, FJ.; Besa Gonzálvez, AJ.; Llopis Albert, C. (2019). Efficient trajectory of a car-like mobile robot. Industrial Robot An International Journal. 46(2):211-222. https://doi.org/10.1108/IR-10-2018-0214S211222462Ghita, N., & Kloetzer, M. (2012). Trajectory planning for a car-like robot by environment abstraction. Robotics and Autonomous Systems, 60(4), 609-619. doi:10.1016/j.robot.2011.12.004Katrakazas, C., Quddus, M., Chen, W.-H., & Deka, L. (2015). Real-time motion planning methods for autonomous on-road driving: State-of-the-art and future research directions. Transportation Research Part C: Emerging Technologies, 60, 416-442. doi:10.1016/j.trc.2015.09.011Li, B., & Shao, Z. (2015). Simultaneous dynamic optimization: A trajectory planning method for nonholonomic car-like robots. Advances in Engineering Software, 87, 30-42. doi:10.1016/j.advengsoft.2015.04.011Rubio, F., Llopis-Albert, C., Valero, F., & Suñer, J. L. (2016). Industrial robot efficient trajectory generation without collision through the evolution of the optimal trajectory. Robotics and Autonomous Systems, 86, 106-112. doi:10.1016/j.robot.2016.09.008Rubio, F., Valero, F., Lluís Sunyer, J., & Garrido, A. (2010). The simultaneous algorithm and the best interpolation function for trajectory planning. Industrial Robot: An International Journal, 37(5), 441-451. doi:10.1108/01439911011063263Sariff, N., & Buniyamin, N. (2006). An Overview of Autonomous Mobile Robot Path Planning Algorithms. 2006 4th Student Conference on Research and Development. doi:10.1109/scored.2006.4339335Renny Simba, K., Uchiyama, N., & Sano, S. (2016). Real-time smooth trajectory generation for nonholonomic mobile robots using Bézier curves. Robotics and Computer-Integrated Manufacturing, 41, 31-42. doi:10.1016/j.rcim.2016.02.002Tokekar, P., Karnad, N., & Isler, V. (2014). Energy-optimal trajectory planning for car-like robots. Autonomous Robots, 37(3), 279-300. doi:10.1007/s10514-014-9390-

Аналіз та можливість модифікації наявних алгоритмів пошуку оптимального шляху на квадратній сітці з використанням методів паралельного програмування

The task about unmanned aerial vehicle optimal path planning between two points on continuous terrain, which has obstacles, was set. Advantages and disadvantages of existing methods of continuous terrain discretization, application of which required for solution the task using computer, were considered. As the most optimal method of continuous terrain discretization the method of square grid was chosen. As selection criteria of the most optimal among existing path planning algorithms on square grid, the alteration angle was accepted. This criteria was suggested because of physical constraints of unmanned aerial vehicle during maneuvers on continuous terrain. According to the chosen criteria, review and analysis of the most widespread path planning algorithms on square grid, which are varieties of А* algorithm, was carrying out, including the short description of the principle of their work and data structures they use. As the most optimal path planning algorithm, which satisfies a given criteria, the LIAN algorithm was chosen. During testing the LIAN implementation in Delphi programming language were discovered disadvantages of this algorithm, and offered possible variants of their solution. Given that proposed and possible further modifications of LIAN will improve qualitative characteristics of founded path, and also will increase its execution time, LIAN algorithm was analyzed on the possibility of its modification using parallel programming methods. Was offer the scheme of work of parallel variant of LIAN algorithm, in which this algorithm will be divided into two parts: parallel part, which will perform integral subtask of the algorithm, and which can be implemented as an instance of one of the parallel threads, and synchronized part, which will be implemented as a main thread. In the context of reliability of software, which will be implement the parallel variant of LIAN algorithm, was determined, to which data structures, which use original LIAN algorithm, can access the synchronized part of new algorithm, and to which can access the parallel part. The specific variants of LIAN algorithm modifications, that use the parallel programming methods, which are planned in the future to implement and research on efficiency and reliability of execution, were offered.Сформирована постановка задачи поиска оптимального пути на непрерывной местности путем её дискретизации с помощью квадратной сетки. Проведен обзор и анализ самых распространенных алгоритмов планирования пути на квадратной сетке, которые представляют собой разновидности алгоритма А*. В качестве алгоритма поиска оптимального пути на квадратной сетке, который учитывает физические ограничения беспилотного летательного аппарата, был выбран алгоритм LIAN. Были обнаружены недостатки алгоритма LIAN и возможные пути их решения, а также предложены варианты его модификации с использованием методов параллельного программирования.Сформована постановка задачі пошуку оптимального шляху на неперервній місцевості шляхом її дискретизації за допомогою квадратної сітки. Проведений огляд та аналіз найпоширеніших алгоритмів планування шляху на квадратній сітці, які є різновидами алгоритму А*. У якості алгоритму пошуку оптимального шляху на квадратній сітці, що враховує фізичні обмеження безпілотного літального апарату, був обраний алгоритм LIAN. Були виявлені недоліки алгоритму LIAN та можливі шляхи їх вирішення, а також запропоновані варіанти його модифікації з використанням методів паралельного програмування

Методы планирования пути в среде с препятствиями (обзор)

Planning the path is the most important task in the mobile robot navigation. This task involves basically three aspects. First, the planned path must run from a given starting point to a given endpoint. Secondly, it should ensure robot’s collision-free movement. Thirdly, among all the possible paths that meet the first two requirements it must be, in a certain sense, optimal.Methods of path planning can be classified according to different characteristics. In the context of using intelligent technologies, they can be divided into traditional methods and heuristic ones. By the nature of the environment, it is possible to divide planning methods into planning methods in a static environment and in a dynamic one (it should be noted, however, that a static environment is rare). Methods can also be divided according to the completeness of information about the environment, namely methods with complete information (in this case the issue is a global path planning) and methods with incomplete information (usually, this refers to the situational awareness in the immediate vicinity of the robot, in this case it is a local path planning). Note that incomplete information about the environment can be a consequence of the changing environment, i.e. in a dynamic environment, there is, usually, a local path planning.Literature offers a great deal of methods for path planning where various heuristic techniques are used, which, as a rule, result from the denotative meaning of the problem being solved. This review discusses the main approaches to the problem solution. Here we can distinguish five classes of basic methods: graph-based methods, methods based on cell decomposition, use of potential fields, optimization methods, фтв methods based on intelligent technologies.Many methods of path planning, as a result, give a chain of reference points (waypoints) connecting the beginning and end of the path. This should be seen as an intermediate result. The problem to route the reference points along the constructed chain arises. It is called the task of smoothing the path, and the review addresses this problem as well.Планирование пути — важнейшая задача в области навигации мобильных роботов. Эта задача включает в основном три аспекта. Во-первых, спланированный путь должен пролегать от заданной начальной точки к заданной конечной точке. Во-вторых, этот путь должен обеспечивать движение робота с обходом возможных препятствий. В-третьих, путь должен среди всех возможных путей, удовлетворяющих первым двум требованиям, быть в определенном смысле оптимальным.Методы планирования пути можно классифицировать по разным признакам. В контексте использования интеллектуальных технологий их можно разделить на традиционные методы и эвристические методы. По характеру окружающей обстановки можно разделить методы планирования на методы планирования в статической окружающей среде и в динамической среде (следует, однако, отметить, что статическая окружающая среда редко встречается на практике). Методы также можно разделить по полноте информации об окружающей среде: методы с полной информацией (в таком случае говорят о глобальном планировании пути) и методы с неполной информацией (обычно речь идет о знании обстановки в непосредственной близости от робота, в этом случае речь идет о локальном планировании пути). Отметим, что неполная информация об окружающей среде может быть следствием меняющейся обстановки, т.е. в условиях динамической среды планирование пути, как правило, локальное.В литературе предложено большое количество методов планирования пути, в которых используются различные эвристические приемы, вытекающие, как правило, из содержательного смысла решаемой задачи. В настоящем обзоре  рассматриваются основные подходы к решению задачи. Здесь можно выделить пять классов основных методов: методы на основе графов, методы на основе клеточной декомпозиции, использование потенциальных полей, оптими­зационные методы, методы на основе интеллектуальных технологий.Многие методы планирования пути в качестве результата дают цепь опорных точек (путевых точек), соединяющую начало и конец пути. Это следует рассматривать как промежуточный результат. Возникает задача прокладки пути вдоль построенной цепи опорных точек, называемая задачей сглаживания пути. Этой задаче в обзоре также уделено внимание

Path planning for unmanned aerial vehicles using visibility line-based methods

This thesis concerns the development of path planning algorithms for unmanned aerial vehicles (UAVs) to avoid obstacles in two- (2D) and three-dimensional (3D) urban environments based on the visibility graph (VG) method. As VG uses all nodes (vertices) in the environments, it is computationally expensive. The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. The computational efficiency of the proposed algorithms is further improved by limiting the BL’s length, which results in an even smaller number of vertices. Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. While vertices can be explicitly defined in 2D environments using VG, it is difficult to determine them in 3D as they are infinite in number at each obstacle’s border edge. This issue is tackled by using the so-called plane rotation approach in the proposed 3D path planning algorithms where the vertices are the intersection points between a plane rotated by certain angles and obstacles edges. In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. In addition, a software package using Matlab for 2D and 3D path planning has also been developed. The package is designed to be easy to use as well as user-friendly with step-by-step instructions

Earplug

Earplug have been created since a long time ago, the earliest patent earplug was made in 1884. Human tend to use finger to cover their ears to blocking the noise absorb by the ear. It was surprisingly effective but human unable to sustain for a long period of time and while using finger to decrease the volume, human unable to do other work in such condition

Framed-Quadtree Path Planning for Mobile Robots Operating in Sparse Environments

Mobile robots operating in vast outdoor unstructured environments often only have incomplete maps and must deal with new objects found during traversal. Path planning in such sparsely occupied regions must be incremental to accommodate new information, and, must use efficient representations. In previous work we have developed an optimal method, D*, to plan paths when the environment is not known ahead of time, but, rather is discovered as the robot moves around. To date, D * has been applied to a uniform grid representation for obstacles and free space. In this paper we propose the use of D * with framed quadtrees to improve the efficiency of planning paths in sparse environments. The new system has been tested in simulation as well on an autonomous jeep, equipped with local obstacle avoidance capabilities

Development of a Real-Time Hierarchical 3D Path Planning Algorithm for Unmanned Aerial Vehicles

Unmanned aerial vehicles (UAVs) frequently operate in partially or entirely unknown environments. As the vehicle traverses the environment and detects new obstacles, rapid path replanning is essential to avoid collisions. This thesis presents a new algorithm called Hierarchical D* Lite (HD*), which combines the incremental algorithm D* Lite with a novel hierarchical path planning approach to replan paths sufficiently fast for real-time operation. Unlike current hierarchical planning algorithms, HD* does not require map corrections before planning a new path. Directional cost scale factors, path smoothing, and Catmull-Rom splines are used to ensure the resulting paths are feasible. HD* sacrifices optimality for real-time performance. Its computation time and path quality are dependent on the map size, obstacle density, sensor range, and any restrictions on planning time. For the most complex scenarios tested, HD* found paths within 10% of optimal in under 35 milliseconds

System of Terrain Analysis, Energy Estimation and Path Planning for Planetary Exploration by Robot Teams

NASA’s long term plans involve a return to manned moon missions, and eventually sending humans to mars. The focus of this project is the use of autonomous mobile robotics to enhance these endeavors. This research details the creation of a system of terrain classification, energy of traversal estimation and low cost path planning for teams of inexpensive and potentially expendable robots. The first stage of this project was the creation of a model which estimates the energy requirements of the traversal of varying terrain types for a six wheel rocker-bogie rover. The wheel/soil interaction model uses Shibly’s modified Bekker equations and incorporates a new simplified rocker-bogie model for estimating wheel loads. In all but a single trial the relative energy requirements for each soil type were correctly predicted by the model. A path planner for complete coverage intended to minimize energy consumption was designed and tested. It accepts as input terrain maps detailing the energy consumption required to move to each adjacent location. Exploration is performed via a cost function which determines the robot’s next move. This system was successfully tested for multiple robots by means of a shared exploration map. At peak efficiency, the energy consumed by our path planner was only 56% that used by the best case back and forth coverage pattern. After performing a sensitivity analysis of Shibly’s equations to determine which soil parameters most affected energy consumption, a neural network terrain classifier was designed and tested. The terrain classifier defines all traversable terrain as one of three soil types and then assigns an assumed set of soil parameters. The classifier performed well over all, but had some difficulty distinguishing large rocks from sand. This work presents a system which successfully classifies terrain imagery into one of three soil types, assesses the energy requirements of terrain traversal for these soil types and plans efficient paths of complete coverage for the imaged area. While there are further efforts that can be made in all areas, the work achieves its stated goals