Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusions
References
All Topics
Engineering
Mechanical Engineering

Autonomous search by robots and animals: A survey

Profile image of John StaddonJohn Staddon

1997, Robotics and Autonomous Systems

https://doi.org/10.1016/S0921-8890(97)00014-6
visibility

…

description

12 pages

link

1 file

Abstract

This paper is a survey of research on autonomous search strategies which originate in engineering and biology. Our motivation is to identify methods of search in an essentially two-dimensional Euclidean space, which can be applied to the area of demining. Such search strategies are based on spatio-temporal distributions. These distributions may be known in advance, because of prior intelligence or through the use of remote sensing, or they may be the result of on-line gathering of information as the search progresses, or of both. We first review the literature on search and coordination which emanates from the field of robotics, we then summarize significant research in the field of animal search, and also discuss relevant results in robotics which are inspired by animal behavior.

Related papers

Coordination mechanisms for a multi-agent robotic system applied to search and target location
Christian G. Quintero M.

… Symposium, 2011 IEEE IX …, 2011

In this paper we consider the problem of searching an unknown number of targets in static environment by a team of robots. As the targets positions and distribution are uncertain; the goal is to minimize the overall exploration time. Using cell maps, the key problem can be solved choosing the suitable cell for the individual robots so that they simultaneously explore different regions of the environment. We present an intelligent approach for the coordination of multiple robots, in which contrast to previous approaches, able to perform task allocations taking into account the trade-off between the costs of reaching the cell and its utility. This utility function has been modeled using neural networks and optimized with genetic algorithms. Besides, if the task produces some conflict between robots, a negotiation algorithm is used to collision avoidance. The proposed approach has been implemented in real-world experiments and its performance tested in simulation runs. The results given in this paper demonstrate that our coordination mechanism significantly reduces the exploration time and increase the effectiveness compared to previous approaches.

View PDFchevron_right
Automated Multi-Robot Search for a Stationary Target
Mahdi Nisirat

International Journal of Control Science and Engineering, 2014

In this paper, a team of identical mobile robots were used to perform a search technique in order to find a stationary object. Considering search time minimization, the search procedures is maintained until the object is found. During the search process, each mobile models the in vicinity environment, and distributes the sensory information to the other robots. This practise would trim down search area overlap between the different robots. Two distinct exploration techniques were utilized, concurrently, as search techniques, namely, the standard frontier-based search technique and the reduced overlap frontier search technique. The former is assumed a standard well known exploration method, while the latter is used to diminish the overlap possibilities between the searching robots. Obtained results confirm that search techniques optimization is governed by time reduction as has been concluded for the exploration techniques.

View PDFchevron_right
Exploring Dynamic Environments Using Stochastic Search Strategies
Gustavo Carreón

Research in Computing Science, 2016

In this paper, we conduct a literature review of laws of motion based on stochastic search strategies which are mainly focused on exploring highly dynamic environments. In this regard, stochastic search strategies represent an interesting alternative to cope with uncertainty and reduced perceptual capabilities. This study aims to present an introductory overview of research in terms of directional rules and searching methods mainly based on bio-inspired approaches. This study critically examines the role of animal searching behavior applied to random walk models using stochastic rules and kinesis or taxis. The aim of this study is to examine existing techniques and to select relevant work on random walks and analyze their actual contributions. In this regard, we cover a wide range of displacement events with an orientation mechanism given by a reactive behavior or a sourceseeking behavior. Finally, we conclude with a discussion concerning the usefulness of using optimal foraging strategies as a reliable methodology.

View PDFchevron_right
Novel physicomimetic bio-inspired algorithm for search and rescue applications
Rahul Rajan

2017 IEEE Symposium Series on Computational Intelligence (SSCI)

Decentralized algorithms are often used for multiagent search in scenarios in which it is difficult or computationally intractable to use a centralized control strategy. "Bottom-up" multi-agent search techniques, or algorithms that are based on local interactions between agents and their environment, allow for highly scalable and fault tolerant systems. Moreover, they often demonstrate remarkable emergent properties, such as foraging behavior and emulated states of matter, which can be found in bio-inspired swarm algorithms and physics-inspired methods. However, it is often difficult to control these systems, especially when area coverage and target localization are the primary goals. In this paper we propose using stigmergic techniques combined with physicomimetic force laws to guide a multi-agent system toward efficiently exploring a pre-defined search area. We found that our method provides a reliable and effective method for decentralized area coverage by a multi-agent system. Furthermore, we implemented our approach using Robot Operating System (ROS) and the Gazebo simulation environment.

View PDFchevron_right
The Organization of Exhaustive Searches in a Patchy Space by Capuchin Monkeys (Cebus apella
Carlo De Lillo

Journal of Comparative Psychology, 1997

Search is a serial exploration of alternatives. Efficient search involves the ability to minimize costs (i.e., time/energy) and to keep track of alternatives already explored. The search abilities of 4 capuchin monkeys (Cebus apella) were evaluated by means of an apparatus featuring a set of suspended baited containers. The experiment featured conditions with different spatial configurations of the search space. Results show that the monkeys were able to search exhaustively 9 containers spatially distributed either as a 3 × 3 matrix or as 3 "patches" of 3 containers each. Search efficiency was higher in a search space suitable to organization in clusters or spatial chunks. In this condition, evidence for principled organization of search trajectories, as opposed to a random walk through the search space, emerges clearly and parallels search efficiency. This suggests that monkeys impose a structure over the search space and, by doing so, reduce the memory demands of the task.

View PDFchevron_right
Design and Development of a Robotic Platform for the Evaluation of Search Algorithms
Pilar Barreiro

We propose the use of the "infotaxis" search strategy as the navigation system of a robotic platform, able to search and localize infectious focus by detecting the changes in the profile of volatile organic compounds emitted by an infected plant. To evaluate and characterize search strategies able to locate a chemical source we have built and developed a simple and cost effective robot platform that substitutes odour sensors in favour of light sensors and study their robustness and performance under non ideal conditions such as the existence of obstacles due to land topology or weeds and the foreseen errors of the odour sensors. Our experimental tests are complemented with extensive numerical simulations.

View PDFchevron_right
Experimental study on the effects of communication range on cooperative robotic search in complex environments
Jacques Penders

2009

Communication has an important role in multirobot systems. It can facilitate cooperation, therefore, improve the performance of the system significantly. In this study we investigated the benefits of networked communication by experimentally evaluating the results of two search algorithms which are spiral search and informed random search. The experiments were performed in an experimental area containing obstacles and using e-puck robots where the communication ranges were "simulated" with the help of an overhead camera. Each robot was allowed to (i) keep an occupancy grid based local map of the environment containing also information about the cells it has visited and (ii) exchange this information with the other robots within its communication range. The effect of the size of communication range on the performance of the system defined as the time of completion of the search task (i.e, locating the target), was investigated.

View PDFchevron_right
Biologically Inspired Intelligence with Applications on Robot Navigation
Chaomin Luo

Artificial Intelligence - Emerging Trends and Applications, 2018

Biologically inspired intelligence technique, an important embranchment of series on computational intelligence, plays a crucial role for robotics. The autonomous robot and vehicle industry has had an immense impact on our economy and society and this trend will continue with biologically inspired neural network techniques. In this chapter, multiple robots cooperate to achieve a common coverage goal efficiently, which can improve the work capacity, share the coverage tasks, and reduce the completion time by a biologically inspired intelligence technique, is addressed. In many real-world applications, the coverage task has to be completed without any prior knowledge of the environment. In this chapter, a neural dynamics approach is proposed for complete area coverage by multiple robots. A bio-inspired neural network is designed to model the dynamic environment and to guide a team of robots for the coverage task. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting neural equation. Each mobile robot treats the other robots as moving obstacles. Each robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot position. The proposed model algorithm is computationally simple. The feasibility is validated by four simulation studies.

View PDFchevron_right
Autonomous exploration for search and rescue robots
Daniele Calisi

Safety and Security Engineering II, 2007

Search and rescue scenarios offer a wide variety of tasks where the experimentation of mobile robots is possible. Specifically, we describe some of the issues arising from scenarios where full autonomy of the robot is required. In this paper after briefly describing our robot configuration and basic functionalities, we address the exploration problem for a rescue robot and present a fully autonomous strategy for this task. We explain algorithms and methods used for this process and present typical experimental results.

View PDFchevron_right
Robot Planning and Exploration Using Fast Marching
Santiago Garrido

2008

Resumen El mtodo propuesto se basa en el paradigma de planificacin global de trayectorias basadas en sensores. Esta aproximacin a la planificacin est basada en un modelo capaz de integrar rpidamente la informacin sensorial en un modelo del entorno basado en rejilla y que calcula una trayectoria consistente, suave y segura de manera suficientemente rpida para ser usada como mtodo de navegacin reactiva. Esta aproximacin tiene ciertas ventajas: una es la capacidad de la planificacin global para garantizar una trayectoria entre la posicin inicial y la posicin final, si tal trayectoria existe. Las otras son la suavidad de la trayectoria (el trmino suave es usado para denotar C ∞) y la seguridad de la trayectoria obtenida. Esta solucin elimina el problema de que la trayectoria se quede atrapada en un mnimo local y las oscilaciones que sufren otros mtodos de potencial. Adems, la metodologa elimina indirectamente la necesidad de supervisin del sistema para detectar fallos debidos a mnimos locales para determinar una trayectoria global admisible desde la posicin inicial hasta la posicin final. Esto permite una simplificacin de las arquitecturas de robots mviles, mientras se mantiene una buena respuesta temporal, con trayectorias suaves y seguras con curvatura continua. La trayectoria generada es la ms rpida posible que tiene en consideracin la velocidad aceptable en cada punto.

View PDFchevron_right

References (68)

  1. J. Barraquand and J.C. Latombe, Robot motion planning: A distributed representation approach. Technical Report. Department of Computer Science, Stanford University, 1989.
  2. J. Barraquand and J.C. Latombe, A Monte-Carlo algorithm for path planning with many degrees of freedom, Proc. IEEE Int. Conf. on Robotics and Automation (1990) 1712-1717.
  3. S. Benhamou, Orientation and foraging movements in a patchy environment by the ant Serrastruma lujae (formicidae-myrmicinae), Behavioural Processes 30 (3) (1993) 233-244.
  4. S, Benhamou, Spatial memory and searching efficiency, Animal Behaviour 47 (6) (1994) t423-1433.
  5. G. Beni, The concept of cellular robot. IEEE Proc. Symp. on Intelligent Control (1988) 57-61.
  6. G. Beni and S. Hackwood, Stationary waves in cyclic swarms, Proc. IEEE Int. Symp. on Intelligent Control (1992) 234-242.
  7. G. Beni and J. Wang, Theoretical problems for the realization of Distributed Robotic Systems, Proc. IEEE lnt. Conf on Robotics and Automation (1991) 1914--1920.
  8. P. Bovet and S. Benhamou, Optimal sinuosity in central place foraging movements, Animal Behaviour 42 (1) (1991) 57-62.
  9. J.F. Canny and M.C. Lin, An opportunistic global path planner, Proc. IEEE Int. Cot![i on Robotics and Automation (1990) 1554-1559.
  10. M.H. Cassini, Searching strategies within food patches in the armadillo Chaetophractus vellerosus, Animal Behaviour 46 (2) (1993) 400--402.
  11. A. Colorni, M. Dorigo and V. Maniezzo, Distributed optimization by ant colonies, Proc. 1st European Cot!f. on Artificial Life (1992) 134-142.
  12. C.I. Connolly. J.B. Burns and R. Weiss, Path planning using Laplace's equation, Proc. IEEE lnt, Conf on Robotics and Automation ( t 990) 2102-2106.
  13. 113~ A. Dejean, G. Beugnon and J.P. Lachaud, Spatial components of foraging bemyrmicinae, Behavioural Processes 30 (3) (1993) 233-244.
  14. D.D, Devries, R.A. Stein and EL. Chesson, Sunfish foraging among patches: The patch-departure decision, Animal Behaviour 37 (3) (1989) 455-464.
  15. B. Faverjon and E Tournassound, A practical approach to motion planning for manipulators with many degrees of freedom, Proc. 5th Int. Symp. on Robotics Research (1989) 65-73.
  16. R.E Franklin and L.A. Harmon, Elements of cooperative behavior, Technical Report, ERIM Internal Research and Development Final Report 655404-1-E 1987.
  17. E. Gelenbe, Random neural networks with negative and positive signals and product form solution, Neural Computation i (4) (1989) 502-511.
  18. E. Gelenbe, Stability of the random neural network model, Neural Computation 2 (2) (1990) 239-247.
  19. I191 E. Gelenbe, Learning in the recurrent random neural network, Neural Computation 5 (I) (1993) 154-164.
  20. E. Gelenbe, Genetic algorithms which learn, in: Int. Workshop on Biologically Inspired Autonomous Systems (Duke University, Duke, 1996).
  21. E. Gelenbe, Genetic algorithms with analytical solution: 1 submitted to Evolutionao' Coml)utation, December 1995; also accepted as a long paper in Genetic Ptwgramming 1996 Cot!ference, Stanford, July 1996.
  22. E. Gelenbe and J. Cao, Autonomous search for mines, European Journal of Operations Research, to appear.
  23. E. Gelenbe and Y. Feng, Autonomous search of taint objects in strong clutter, in preparation.
  24. E. Gelenbe and A. Stafylopatis, Global behaviour of homogeneous random neural systems, Applied Mathematical Modelling 15 ( 1991 ) 535-54 t.
  25. S. Gross and J.L. Deneubourg, Harvesting by a group of robots, Proc. 1st European Conf on Arti[icial Lijb (1992) 195-204.
  26. R.D. Harkness and N.G. Maroudas, Central place foraging by an ant (Cataglyphis bicolor Fab.): A model of searching, Animal Behaviour 33 (3) (1985)916-928.
  27. J.M. Horner, J.E.R. Staddon and K. Lozano, Pigeons sensitivity to cyclical changes m reinforcement probability, in preparation.
  28. E. Hou and D. Zheng, Mobile robot path planning based on hierarchical hexagonal decomposition and artificial potential fields, Journal of Robotic 5:~,stems (1994) 605-614.
  29. D.E Johnson and G. Collier, Patch choice and meal size of foraging rats as a function of the profitability of food, Animal Behaviour 38 (2) (1989) 285-297.
  30. C. Jorgensen, W. Hamel and C. Weisbin, Autonomous robot navigation, BYTE 11 (t986) 223-235.
  31. A.C. Kamil, F. Lindstrom and J. Peters, The detection of cryptic prey by blue jays (Cyanocitta cristata): I. The effects of travel time, Animal Behaviour 33 (4) (1985) 1068-1079.
  32. O, Khatib, Real-time obstacle avoidance for manipulators and mobile robots, International Journal of Robotics Research 5 ( 1 ) ( ! 986) 90-99.
  33. D.E. Koditschek, Exact robot navigation by means of potential functions: some topological considerations, in: Proc. IEEE Int. Conj. on Robotics and Automation (1987) 1-6.
  34. J.R. Koza, J.R Rice and J. Roughgarden, Evolution of food- foraging strategies for the Caribbean Anolis lizard using genetic programming, Adaptive Behavior I (2) (1992) 171-199.
  35. J.C. Latombe, Robot Motion Planning (Kluwer Academic Publishers, Norwell, MA, I991).
  36. G, Lucarini, M. Varoli, R. Cerutti and G. Sandini, CelluJar Robotics: Simulation and hardware implementation. Proc. IEEE lnt. Conf on Robotics and Automation (1993) 846-852.
  37. D. Maio and S. Rizzi, Map Learning and Cluslering in Autonomous Systems, 1EEL Transaction On Pattern Analysis Altd Machine Intelligence 15 (21 (1993) 1286-1297.
  38. M.J. Mataric, Distributed approaches to behavior comrol, Proc. SPIE, Vol. 1828, Sensor Fusion V (1992) 373-382.
  39. B.E McMahon and R.M. Evans, Foraging strategies of American white pelicans, Behaviour 120 (1-2) (1992) 69-89.
  40. J. McNamara and A. Houston, A simple model of intk)rrnation use in the exploitation of patchily distributed food, Animal Behaviour 33 (2) (I 985) 553-560.
  41. J.M. McNamara, R.H. Mace, R.H. Houston and A.I. Houston, Optimal daily routines of singing and lk)raging in a bird singing to attract a mate, Behm'ioral Ecology and Sociobiology 20 (6) (1987) 399-405.
  42. J.A. Meyer, H.L. Roitblat and S.W. Wilson, From animals to Animats 2: Proc. 2rid, Int. Cor~/~ on Simulation ~/ Adaptive Behavior (Complex adaptive systems) (MIT Press~ Cambridge, MA, 1992) 432-510.
  43. A.L. Moody and A.I. Houston, Interference and the ideal tree distribution, Animal Behaviour 49 (4) (1995) 1065 1072.
  44. M. Noda. K. Gushima and S. Kakuda, l,ocal prey search based on spatial memory and expectation in the planktivorous reef fish Chromis chrysurus (Pomacentridae), Animal Behaviour 47 (6) (1994) 1413- 1422.
  45. J.G. Ollason, A.E. Lamb, The meaninglessness of foraging behaviour, in: N.S. Thompsom ed,, Perspectives in Ethology. Vol. I1: Behavioral design (Plenum Press, New York, NY) 279-295.
  46. D.R. Papaj, Shifts in foraging behavior by a Battus philenor population: Field evidence for switching by individual butterflies, Behavioral Ecology and Sociobio/ogy 19 (1) (1986) 31-39.
  47. L.E. Parker, Designing control laws for cooperative agent teams, Proc. IEEE h~t. Conf. on Robotics and Automation (1994) 582-587.
  48. N. Rao, Algorithmic framework for learned robot navigation in unknown terrains, Computer (1989) 37-43.
  49. J. Reif and H. Wang, Social potential fields: A distributed behavioral control tar autonomous robots, Proc. Workshop on the Algorithmic Foundations of Robotics (19941 331-345.
  50. E. Rimon and J.E Canny, Construction of C-space roadmaps from local sensory data: What should the sensors look lk~r'?, Proc. IEEE Int. Conf on Robotics a~ld Automation (1994) 117-I23.
  51. E. Rimon and D.E. Koditschek, The constructin of analytic diffeomorphisms for exact robot navigation on star worlds, Transactions of the American Mathematical Society 327 (1) (19911) 71-116.
  52. E. Rimon and D.E. Koditschek, Exact robot navigation using artificial potential functions, 1EEE Transactions on Robotics and Automation 8 ( t 992) 501-518.
  53. N. Schmajuk and H.T. Blair, Place learning and the dynamics of spatial navigation: A neural network approach, Adaptive Behavior I (3) (1993) 353-385,
  54. N. Schmajuk, A.D. Thieme and H.T. Blair, Maps, routes and the Hippocampus: A neural network approach, Hippocampus 3 (3) (1993) 387-400.
  55. W. Sheehan, F.L. Wackers and W.J. Lewis, Discrimination of previously searched, host-free sites by Microplitis croceipes (Hymenoptera: Braconidae), Journal of Insect Behavior 6 (3) (1993) 323-331.
  56. S.J. Shettleworth, J.R. Krebs, D.W. Stephens and J. Gibbon, Tracking a fluctuating environment: A study of sampling, Animal Behaviour 36 (1) (1988) 87-105.
  57. Z. Shiller and Y.R. Gwo. Dynamic motion planning of autonomous vehicles, IEEE Transaction On Robotics and Automation 7 (2) ( 199 l) 241-249.
  58. Y. Shoham and M. Tennenholtz, On the synthesis of useful social laws for artificial agent societies, Proc. lOth National Conf on Arti[icial Intelligence (.1992) 276--281.
  59. R.L. Soltz, Foraging path selection in bumblebees: Hindsight or foresight'?, Behaviour 99 (1-2) (1986) 1-21.
  60. G.A. Sonerud, Search tactics of a pause-travel predator: Adaptive adjustments of perching times and move distances by hawk owls (Surnia ulula), Behavioral Ecology and Sociobiology 30 (3-4) (1992) 207-217.
  61. R Pf. Spelt, E. Lyness and G. deSaussure, Development and training of a learning expert system in an autonomous mobile robor via simulation, Simulation (1989) 223-228.
  62. D.W. Stephens and S.R. Patton, How constant is the constant of risk-aversion?, Animal Behaviour 34 (6) (19861 1659-1667.
  63. K. Sugihara and I. Suzuki, Distributed motion coordination of multiple mobile robots, Proc. 5th 1EEE Int. Syrup. on Intelligent Control (1990) 138-143.
  64. T. Ueyama and T. Fukuda, Self-organization of cellular robots using random walk with simple rules, Proc. IEEE Int. Conj. on Robotics and Automation (1993) 595-600.
  65. C.W. Warren, Global path planning using artificial potential fields, Proc. IEEE Int. Conf on Robotics and Automation (1989) 316-321.
  66. J.A. Weier and D.H. Feener, Foraging in the seed-harvester ant genus Pogonomyrmex: Are energy costs important'?, Behavioral Ecology and Sociobiology 36, 291-300.
  67. CR. Weisbin, G. deSaussure, J.R. Einstein and F.G. Pin, Autonomous mobile robot navigation and learning, Computer (1989) 29-35.
  68. D.L. Winkelman and G.L. Vinyard, Gyrinid searching tactics: Empirical observations and a tactical model, Behavioral Ecology and Sociobiology 28 (5) (1991) 345-351. =: Erol Gelenbe is a Chaired Professor and Chairman of Electrical and Com- puter Engineering at Duke. His inter- ests cover autonomous search, neural networks, image processing, discrete stochastic processes, and genetic algo- rithms. He has authored four books, published over 85 journal articles and many conference papers. A Fellow of the IEEE (1986), his honors include the Grand Prix France Telecom (1996) of the French Academy, the doctor- ate honoris causa from the University of Rome II (1996), the Science Award of the Parlar Foundation (Turkey, 1995), the Chevalier de VOrdre du M6rite (.1992) from the French Government, and the IFIP Silver Core Award (1980). He has edited the October 1996 issue of the Proc. IEEE on Engineer- ing Applications o[Neural Networks. His research is funded by ONR, ARO. and NATO.

Related papers

Canine as Robot in Directed Search
Alex Ferworn

2007 IEEE International Conference on System of Systems Engineering, 2007

One of the goals of rescue robotics has inevitably lead to the production of rubble often on a been to allow machines to sense and act where vast scale. Speed, accuracy and safety are critical factors people cannot go. Deployed with various sensors and when searching for survivors in urban area turned to under the guidance of trained operators these rubble. systems have shown great potential for finding victims in rubble. However, the current state of Unfortunately search is a difficult and often mobility of all deployed rescue robots is such that dangerous process. While buildings collapse in they can only be employed in very constrained predictable ways, the orientation, interaction and size of circumstances where surfaces are mostly regular and the rubble piles formed are often unpredictable. Spaces acceptable for various modes of tracked and wheeled or voids appear and disappear as the piles shift and mobility. We have been exploring an alternative settle. As time passes the rubble settles but the employing the existing abilities of trained USAR probability of finding survivors is greatly reduced. canines to search rubble both quickly and effectively. Searching though rubble is time consuming because This paper discusses one ofthe potential areas where footing is often unstable as are the structures that form as canines might be augmented to deliver the desired a result of the initial collapse. There are usually no sensing and remote control ofa robot. obvious paths and the threat of secondary collapse is sometimes a concern and often limits where searchers Kireteywords:ar Canine Augme ntch,USAtionR can go. Coordination of the search effort is made more directed search,'rubble search, USAR. difficult by the rigors of simply moving around on the

View PDFchevron_right
A Novel Search Strategy for Autonomous Search and Rescue Robots
Levent Akin

RoboCup 2004: Robot soccer world cup VIII, 2005

View PDFchevron_right
Territory Formation in Mobile Robots
Amelie Schmolke

2002

Animals navigate through their environment using di- verse strategies. These navigation strategies might be highly dependent on the animal's ecological niche. Though a lot of work is focused on biological navigation mechanisms, the cognitive ecology of spatial memory is poorly understood. The performances of dieren t nav- igation mechanisms in the context of a biologically rel- evant behavior can be

View PDFchevron_right
Spiral search as an efficient mobile robotic search technique
Gregory Dudek

1999

In this paper we consider the problem of robotic search: that is, having a mobile robot find a target object in an unknown environment with obstacles. As a side-effect, the robot explores the environment. Based on previous results, we present a formal description of our problem and an algorithm to solve it. Our work is a derivative of spiral search techniques developed in more abstract contexts. We show that this algorithm has good worst-case performance, in terms of its competitive ratio. We also show experimental data validating the feasibility of our approach and typical results.

View PDFchevron_right
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
Alejandro Sarmiento

2004

In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment. We show that for this problem, a trajectory that minimizes the distance traveled may not minimize the expected value of the time to find the object. We prove the problem to be NP-hard by reduction, therefore, we propose the heuristic of a utility function. We use this utility function to drive a greedy algorithm in a reduced search space that is able to explore several steps ahead without incurring too high a computational cost. We have implemented this algorithm and present simulation results for a multi-robot scheme.

View PDFchevron_right

Related topics

  • Mechanical Engineering
  • Robotics
  • Remote Sensing
  • Autonomous Robotics
  • Electrical and Electronic Engine...

    • Cited by

    Emergency navigation without an infrastructure
    Huibo Bi

    Sensors (Basel, Switzerland), 2014

    Emergency navigation systems for buildings and other built environments, such as sport arenas or shopping centres, typically rely on simple sensor networks to detect emergencies and, then, provide automatic signs to direct the evacuees. The major drawbacks of such static wireless sensor network (WSN)-based emergency navigation systems are the very limited computing capacity, which makes adaptivity very difficult, and the restricted battery power, due to the low cost of sensor nodes for unattended operation. If static wireless sensor networks and cloud-computing can be integrated, then intensive computations that are needed to determine optimal evacuation routes in the presence of time-varying hazards can be offloaded to the cloud, but the disadvantages of limited battery life-time at the client side, as well as the high likelihood of system malfunction during an emergency still remain. By making use of the powerful sensing ability of smart phones, which are increasingly ubiquitous, ...

    View PDFchevron_right
    A Survey of Algorithms and Systems for Evacuating People in Confined Spaces
    Erol Gelenbe

    Electronics

    The frequency, destruction and costs of natural and human-made disasters in modern highly-populated societies have resulted in research on emergency evacuation and wayfinding, which has drawn considerable attention. The subject is now a multidisciplinary area of research where information and communication technologies (ICT), and in particular the Internet of Things (IoT), have a significant impact on sensing and computing dynamic reactions that mitigate or prevent the worst outcomes of disasters. This paper offers state-of-the-art knowledge in this area so as to share ongoing research results, identify the research gaps and address the need for future research. We present a comprehensive review of research on emergency evacuation and wayfinding, focusing on the algorithmic and system design aspects. Starting from the history of emergency management research, we identify the emerging challenges concerning system optimisation, evacuee behaviour optimisation and data analysis, and the...

    View PDFchevron_right
    Synchronising Energy Harvesting and Data Packets in a Wireless Sensor
    Erol Gelenbe

    Energies, 2015

    We consider a wireless sensor node that gathers energy through harvesting and reaps data through sensing. The node has a wireless transmitter that sends out a data packet whenever there is at least one "energy packet" and one "data packet", where an energy packet represents the amount of accumulated energy at the node that can allow the transmission of a data packet. We show that such a system is unstable when both the energy storage space and the data backlog buffer approach infinity, and we obtain the stable stationary solution when both buffers are finite. We then show that if a single energy packet is not sufficient to transmit a data packet, there are conditions under which the system is stable, and we provide the explicit expression for the joint probability distribution of the number of energy and data packets in the system. Since the two flows of energy and data can be viewed as flows that are instantaneously synchronised, this paper also provides a mathematical analysis of a fundamental problem in computer science related to the stability of the "join" synchronisation primitive.

    View PDFchevron_right
    Time and energy in team-based search
    Erol Gelenbe

    Physical Review E, 2013

    When an object needs to be found in a random environment by a team of searchers, we obtain a formula for the total number of searchers needed if at least k of them must find the object by some large time S. We then compute the energy consumed by the N searchers if they are all stopped as soon as k are successful, and we show that the energy consumed decreases as N increases. We also consider the case in which the successful ones stop but the unsuccessful ones continue until a time-out or until they are destroyed by some other "natural" cause, and in this case we see that the energy consumed increases with N as one might expect. The transform-based analysis used assumes that the searchers' motion is described by diffusion processes, that the search space is infinite and homogeneous, that searchers can be destroyed or become permanently lost as they proceed, and that a time-out mechanism is used so that any searcher that exceeds this time-out and has not succeeded in its quest will be removed and replaced by a new searcher that behaves stochastically and independently of its predecessor.

    View PDFchevron_right
    Directional navigation improves opportunistic communication for emergencies
    Erol Gelenbe

    Sensors (Basel, Switzerland), 2014

    We present a novel direction based shortest path search algorithm to guide evacuees during an emergency. It uses opportunistic communications (oppcomms) with low-cost wearable mobile nodes that can exchange packets at close range of a few to some tens of meters without help of an infrastructure. The algorithm seeks the shortest path to exits which are safest with regard to a hazard, and is integrated into an autonomous Emergency Support System (ESS) to guide evacuees in a built environment. The algorithm proposed that ESSs are evaluated with the DBES (Distributed Building Evacuation Simulator) by simulating a shopping centre where fire is spreading. The results show that the directional path finding algorithm can offer significant improvements for the evacuees.

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved