2,468 research outputs found

    Modified spline-based path planning for autonomous ground vehicle

    Get PDF
    © 2017 by SCITEPRESS - Science and Technology Publications, Lda. All Rights Reserved. Potential function based methods play significant role in global and local path planning. While these methods are characterized with good reactive behavior and implementation simplicity, they suffer from a well-known problem of getting stuck in local minima of a navigation function. In this article we propose a modification of our original spline-based path planning algorithm for a mobile robot navigation, which succeeds to solve local minima problem and adds additional criteria of start and target points visibility to help optimizing the path selection. We apply a Voronoi graph based path as an input for iterative multi criteria optimization algorithm. The algorithm was implemented in Matlab environment and simulation results demonstrate that we succeeded to overcome our original algorithm pitfalls

    Path Planning Based on Parametric Curves

    Get PDF
    Parametric curves are extensively used in engineering. The most commonly used parametric curves are, Bézier, B-splines, (NURBSs), and rational Bézier. Each and every one of them has special features, being the main difference between them the complexity of their mathematical definition. While Bézier curves are the simplest ones, B-splines or NURBSs are more complex. In mobile robotics, two main problems have been addressed with parametric curves. The first one is the definition of an initial trajectory for a mobile robot from a start location to a goal. The path has to be a continuous curve, smooth and easy to manipulate, and the properties of the parametric curves meet these requirements. The second one is the modification of the initial trajectory in real time attending to the dynamic properties of the environment. Parametric curves are capable of enhancing the trajectories produced by path planning algorithms adapting them to the kinematic properties of the robot. In order to avoid obstacles, the shape modification of parametric curves is required. In this chapter, an algorithm is proposed for computing an initial Bézier trajectory of a mobile robot and subsequently modifies it in real time in order to avoid obstacles in a dynamic environment

    Sähköbussin nopeuden ja ohjauskulman säätö edellä ajavan ajoneuvon liike-radan seuraamisessa

    Get PDF
    Buses face problems when the capacity of a bus is limited but it should be larger to be able to carry more passengers. The capacity of a bus is already increased to its maximum that is allowed by the infrastructure. The capacity of a bus line could be increased by driving buses more frequently but it would increase costs, that is unwanted. Costs could be reduced by driving buses as platoons consisting of two buses where only the first bus would be operated by a professional driver and the second would be driven autonomously. Autonomous driving requires longitudinal and lateral control of a vehicle. The follower bus should be able to follow the path driven by the leader bus precisely and avoid inter-vehicular collisions while still driving as close together as possible to indicate other traffic that they move as a platoon. Lateral control is usually divided into path following and direct following methods in the literature. Path following methods include obtaining the path of the leader vehicle and following of that path. Path following methods are usually accurate in terms of lateral error but are complex and require a lot of computational capacity. Direct following methods are easy to compute but they do not guarantee precise path following. A simulation model consisting of two identical buses was developed. One longitudinal controller and four lateral control laws were proposed. Longitudinal controller was designed to work also in tight turns which is not usually investigated. Lateral control laws proposed were geometrical in nature and required only input as the relative position of the leader bus. Therefore, they did not require inter-vehicular communication. Longitudinal controller worked well for initialization of the system with inter-vehicular distances from 2 to 10 m. It worked well in acceleration and deceleration tests when both buses were loaded similarly but failed to prevent collisions when follower bus was loaded more heavily than the leader. In lateral controller tests, Pure Pursuit and Modified Pure Pursuit methods were able to follow the leader producing following lateral errors: 0,8 m and 1,1 m (steady-state tests), 0,8 m and 0,7 m (u-turn maneuver) and 0,3 m/0,4 m and 0,4 m/0,5 m (double lane change maneuver, 5 m/s/10 m/s respectively). Spline Pursuit method showed oscillatory behavior and did not follow the leader well. Circular Pursuit method showed also oscillatory behavior and did not follow the leader well. However, it showed better performance than the Spline Pursuit. It remains to be studied whether Pure Pursuit or Modified Pure Pursuit can challenge more sophisticated path following methods.Linja-autojen matkustajakapasiteetti on rajallinen, mikä aiheuttaa ongelmia, sillä sen tulisi olla suurempi. Kapasiteetti on jo nostettu suurimmalle mahdolliselle tasolle, mitä nykyinen infrastruktuuri mahdollistaa. Linja-autolinjan kapasiteettia voisi nostaa ajamalla linja-autoja tiheämmin. Tämä kuitenkin johtaa suurempiin kustannuksiin. Kustannuksia voisi vähentää ajamalla linja-autoja kahden ajoneuvon jonoina, joissa ensimmäistä ajo-neuvoa ohjaisi ammattilaiskuljettaja ja toinen olisi autonomisesti ohjattu. Autonominen ajaminen vaatii ajoneuvon nopeuden ja ohjauskulman säätöä. Seuraajalinja-auton pitää pystyä seuraamaan johtajalinja-auton ajamaa ajouraa tarkasti ja välttää törmäämistä johtajaan. Linja-autojen välinen etäisyys on kuitenkin oltava riittävän pieni, jotta se viestisi muulle liikenteelle, että ajoneuvot ajavat jonona. Kirjallisuus jakaa ohjauskulman säädön yleensä ajouran seuraamiseen ja suoraan seuraamiseen. Ajouran seuraaminen koostuu johtaja-ajoneuvon ajouran saamisesta ja tämän uran seuraamisesta. Ajouran seuraamisen metodit ovat yleensä tarkkoja poikittaisen virheen suhteen, mutta ovat monimutkaisia ja vaativat paljon laskennallista kapasiteettia. Suoran seuraamisen metodit ovat laskennallisesti kevyitä, mutta eivät takaa tarkkaa ajouran seuraamista. Kahdesta identtisestä linja-autosta koostuva simulaatiomalli kehitettiin. Yksi nopeussäädin ja neljä ohjauskulman säätölakia esitettiin. Nopeussäädin suunniteltiin toimimaan myös tiukoissa käännöksissä, mitä ei ole yleensä tutkittu. Ohjauskulman säätölait perustuivat geometriseen päättelyyn ja ne tarvitsivat vain johtajalinja-auton suhteellisen asentotiedon. Säätölait eivät vaatineet ajoneuvojen välistä kommunikaatiota. Nopeussäädin toimi järjestelmän alustamisessa ajoneuvojen välisen etäisyyden ollessa 2-10 m. Se toimi hyvin kiihdytys- ja jarrutustesteissä, kun molemmat linja-autot olivat lastattu identtisellä kuormalla, mutta epäonnistui estämään törmäämisen, kun seuraajalinja-auto oli lastattu suuremmalla kuormalla kuin johtaja. Ohjauskulman säädön testeissä Pure Pursuit ja Modified Pure Pursuit pystyivät seuraamaan johtajaa seuraavilla poikittaissuuntaisilla virheillä: 0,8 m ja 1,1 m (steady-state-testit), 0,8 m ja 0,7 m (u-käännös) ja 0,3 m/0,4 m ja 0,4 m/0,5 m (kaksoiskaistanvaihto, 5 m/s/10 m/s vastaavasti). Spline Pursuit käyttäytyi värähtelevästi eikä seurannut johtajaa hyvin. Circular Pursuit käyttäytyi värähtelevästi eikä seurannut johtajaa hyvin, mutta kuitenkin paremmin kuin Spline Pursuit. Jää nähtäväksi pystyykö Pure Pursuit tai Modified Pure Pursuit haastamaan monimutkaisempia ajouran seuraamisen metodeja

    A Model-Predictive Motion Planner for the IARA Autonomous Car

    Full text link
    We present the Model-Predictive Motion Planner (MPMP) of the Intelligent Autonomous Robotic Automobile (IARA). IARA is a fully autonomous car that uses a path planner to compute a path from its current position to the desired destination. Using this path, the current position, a goal in the path and a map, IARA's MPMP is able to compute smooth trajectories from its current position to the goal in less than 50 ms. MPMP computes the poses of these trajectories so that they follow the path closely and, at the same time, are at a safe distance of eventual obstacles. Our experiments have shown that MPMP is able to compute trajectories that precisely follow a path produced by a Human driver (distance of 0.15 m in average) while smoothly driving IARA at speeds of up to 32.4 km/h (9 m/s).Comment: This is a preprint. Accepted by 2017 IEEE International Conference on Robotics and Automation (ICRA

    Dynamic Replanning of Low Noise Rotorcraft Operations

    Get PDF
    A new method for rapidly planning and dynamically replanning low noise rotorcraft flight operations is developed. A large database of rotorcraft maneuver segments is generated, and an acoustic cost is assigned to each segment by using a computationally efficient semiempirical rotorcraft noise modeling method that accurately models the changes in rotor noise caused by maneuvering flight. Combinatoric optimization techniques are then employed to combine these maneuver segments into a low noise optimal flight path. A simple heuristic for estimating the total acoustic cost required to reach the target location is developed and incorporated into the search algorithm, allowing the computation of low noise paths in seconds. A procedure for implementing an anytime version of the method is described, enabling feasible solutions to be dynamically replanned on the flyi.e., in fractions of a secondand refined over time to a low noise optimal solution
    corecore