Route navigation inspired by foraging insects: following and finding a route again.
Bertrand O (2017)
Bielefeld: Universität Bielefeld.
Bielefelder E-Dissertation | Englisch
Download
![Open access file OA](https://pub.uni-bielefeld.de/images/access_open.png)
Autor*in
Gutachter*in / Betreuer*in
Einrichtung
Abstract / Bemerkung
Navigation is one of the most complex behaviours observed in the animal kingdom. A navigating animal needs to learn and recognise the characteristics at certain locations, to decide in which direction to move to reach its destination and to avoid collisions with objects during its journey. Many insects – bees, ants, and wasps – are fascinating navigators, and their behaviour has been scrutinised in great detail over the past century. With their brain weighing only a few milligrammes, these insects have been an amazing source of inspiration for engineers to develop computationally parsimonious and energy-efficient algorithms, and puzzled scientists about how such a tiny animal can navigate efficiently in a complex world.
The thesis has been inspired by the stunning navigational skills of foraging insects. One of their skills is the ability to follow a habitual route between two locations. As it will be shown in the thesis, route navigation can arise from simple mechanisms; knowing its overall goal direction and employing a collision avoidance algorithm is sufficient to follow a route. However, the journey along a route of an agent, i.e. a biological or technical system, is not always smooth. The journey may be disrupted suddenly by external factors – such as wind or an impending danger – or by internal sources that lead to navigational errors. The agent will, thus, be at an unknown location away from its habitual route and have to find its route again to complete its journey. I will reveal in the thesis a variety of search strategies that an agent may use to find its route again in a cluttered environment, such as a city or a forest. Since a unique optimal search strategy does not exist, it will be shown that the agent can decide which strategy to follow, assuming it can estimate the distance it plans to travel and the distance it has been displaced from its route.
The thesis addresses fundamental questions of navigation by focussing on following and finding a habitual route again. To frame these dilemmas, (1) an overview of navigation will also be given to highlight common fundamental problems faced by any navigating agent, (2) the various degrees of complexity of different strategies to solve navigational tasks and (3) essential aspects of research on insect navigation. Although my modelling approach is inspired by the behaviour of foraging insects, it aims to provide general solutions for any moving agent on how to commute between two locations efficiently.
The thesis has been inspired by the stunning navigational skills of foraging insects. One of their skills is the ability to follow a habitual route between two locations. As it will be shown in the thesis, route navigation can arise from simple mechanisms; knowing its overall goal direction and employing a collision avoidance algorithm is sufficient to follow a route. However, the journey along a route of an agent, i.e. a biological or technical system, is not always smooth. The journey may be disrupted suddenly by external factors – such as wind or an impending danger – or by internal sources that lead to navigational errors. The agent will, thus, be at an unknown location away from its habitual route and have to find its route again to complete its journey. I will reveal in the thesis a variety of search strategies that an agent may use to find its route again in a cluttered environment, such as a city or a forest. Since a unique optimal search strategy does not exist, it will be shown that the agent can decide which strategy to follow, assuming it can estimate the distance it plans to travel and the distance it has been displaced from its route.
The thesis addresses fundamental questions of navigation by focussing on following and finding a habitual route again. To frame these dilemmas, (1) an overview of navigation will also be given to highlight common fundamental problems faced by any navigating agent, (2) the various degrees of complexity of different strategies to solve navigational tasks and (3) essential aspects of research on insect navigation. Although my modelling approach is inspired by the behaviour of foraging insects, it aims to provide general solutions for any moving agent on how to commute between two locations efficiently.
Jahr
2017
Page URI
https://pub.uni-bielefeld.de/record/2908136
Zitieren
Bertrand O. Route navigation inspired by foraging insects: following and finding a route again. Bielefeld: Universität Bielefeld; 2017.
Bertrand, O. (2017). Route navigation inspired by foraging insects: following and finding a route again.. Bielefeld: Universität Bielefeld.
Bertrand, Olivier. 2017. Route navigation inspired by foraging insects: following and finding a route again.. Bielefeld: Universität Bielefeld.
Bertrand, O. (2017). Route navigation inspired by foraging insects: following and finding a route again. Bielefeld: Universität Bielefeld.
Bertrand, O., 2017. Route navigation inspired by foraging insects: following and finding a route again., Bielefeld: Universität Bielefeld.
O. Bertrand, Route navigation inspired by foraging insects: following and finding a route again., Bielefeld: Universität Bielefeld, 2017.
Bertrand, O.: Route navigation inspired by foraging insects: following and finding a route again. Universität Bielefeld, Bielefeld (2017).
Bertrand, Olivier. Route navigation inspired by foraging insects: following and finding a route again. Bielefeld: Universität Bielefeld, 2017.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
Dieses Objekt ist durch das Urheberrecht und/oder verwandte Schutzrechte geschützt. [...]
Volltext(e)
Name
Dissertation_Bertrand_2016.pdf
19.08 MB
Access Level
![Open access file OA](https://pub.uni-bielefeld.de/images/access_open.png)
Zuletzt Hochgeladen
2019-09-25T06:40:53Z
MD5 Prüfsumme
4a3eb9fc1e6dffec6b7be4c3769602fd