top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Autonomous mobile robots and multi-robot systems : motion-planning, communication and swarming / / edited by Eugene Kagan, Nir Shvalb, Irad Ben-Gal
Autonomous mobile robots and multi-robot systems : motion-planning, communication and swarming / / edited by Eugene Kagan, Nir Shvalb, Irad Ben-Gal
Autore Kagan Eugene
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, New Jersey ; ; Chichester, West Sussex, England : , : Wiley, , [2020]
Descrizione fisica 1 online resource (343 pages)
Disciplina 629.8932
Soggetto topico Mobile robots - Automatic control
ISBN 1-119-21316-9
1-5231-3281-7
1-119-21317-7
1-119-21315-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Motion-planning schemes in global coordinates -- Basic perception -- Motion in the global coordinates -- Motion in potential field and navigation function -- GNSS and robot localization -- Motion in local coordinates -- Motion in unknown environment -- Energy limitations and energetic efficiency of mobile robots -- Multi-robot systems and swarming -- Collective motion with shared environment map -- Collective motion with direct and indirect communication -- Brownian motion and swarm dynamics -- Conclusions.
Record Nr. UNINA-9910555038003321
Kagan Eugene  
Hoboken, New Jersey ; ; Chichester, West Sussex, England : , : Wiley, , [2020]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Autonomous mobile robots and multi-robot systems : motion-planning, communication and swarming / / edited by Eugene Kagan, Nir Shvalb, Irad Ben-Gal
Autonomous mobile robots and multi-robot systems : motion-planning, communication and swarming / / edited by Eugene Kagan, Nir Shvalb, Irad Ben-Gal
Autore Kagan Eugene
Edizione [1st edition]
Pubbl/distr/stampa Hoboken, New Jersey ; ; Chichester, West Sussex, England : , : Wiley, , [2020]
Descrizione fisica 1 online resource (343 pages)
Disciplina 629.8932
Soggetto topico Mobile robots - Automatic control
ISBN 1-119-21316-9
1-5231-3281-7
1-119-21317-7
1-119-21315-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Motion-planning schemes in global coordinates -- Basic perception -- Motion in the global coordinates -- Motion in potential field and navigation function -- GNSS and robot localization -- Motion in local coordinates -- Motion in unknown environment -- Energy limitations and energetic efficiency of mobile robots -- Multi-robot systems and swarming -- Collective motion with shared environment map -- Collective motion with direct and indirect communication -- Brownian motion and swarm dynamics -- Conclusions.
Record Nr. UNINA-9910813585903321
Kagan Eugene  
Hoboken, New Jersey ; ; Chichester, West Sussex, England : , : Wiley, , [2020]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Autore Kagan Eugene
Pubbl/distr/stampa Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Descrizione fisica 1 online resource (348 p.)
Disciplina 658.5/3
670.285
Altri autori (Persone) Ben-GalIrad
Soggetto topico Search theory
Target acquisition - Mathematics
Motion - Mathematical models
ISBN 1-118-59659-5
1-118-59704-4
1-299-44937-9
1-118-59710-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; List of figures; Preface; Notation and terms; Chapter 1 Introduction; 1.1 Motivation and applications; 1.2 General description of the search problem; 1.3 Solution approaches in the literature; 1.4 Methods of local search; 1.5 Objectives and structure of the book; References; Chapter 2 Problem of search for static and moving targets; 2.1 Methods of search and screening; 2.1.1 General definitions and notation; 2.1.2 Target location density for a Markovian search; 2.1.3 The search-planning problem; 2.2 Group-testing search
2.2.1 General definitions and notation2.2.2 Combinatorial group-testing search for static targets; 2.2.3 Search with unknown number of targets and erroneous observations; 2.2.4 Basic information theory search with known location probabilities; 2.3 Path planning and search over graphs; 2.3.1 General BF* and A* algorithms; 2.3.2 Real-time search and learning real-time A* algorithm; 2.3.3 Moving target search and the fringe-retrieving A* algorithm; 2.4 Summary; References; Chapter 3 Models of search and decision making; 3.1 Model of search based on MDP; 3.1.1 General definitions
3.1.2 Search with probabilistic and informational decision rules3.2 Partially observable MDP model and dynamic programming approach; 3.2.1 MDP with uncertain observations; 3.2.2 Simple Pollock model of search; 3.2.3 Ross model with single-point observations; 3.3 Models of moving target search with constrained paths; 3.3.1 Eagle model with finite and infinite horizons; 3.3.2 Branch-and-bound procedure of constrained search with single searcher; 3.3.3 Constrained path search with multiple searchers; 3.4 Game theory models of search; 3.4.1 Game theory model of search and screening
3.4.2 Probabilistic pursuit-evasion games3.4.3 Pursuit-evasion games on graphs; 3.5 Summary; References; Chapter 4 Methods of information theory search; 4.1 Entropy and informational distances between partitions; 4.2 Static target search: Informational LRTA* algorithm; 4.2.1 Informational LRTA* algorithm and its properties; 4.2.2 Group-testing search using the ILRTA* algorithm; 4.2.3 Search by the ILRTA* algorithm with multiple searchers; 4.3 Moving target search: Informational moving target search algorithm; 4.3.1 The informational MTS algorithm and its properties
4.3.2 Simple search using the IMTS algorithm4.3.3 Dependence of the IMTS algorithm's actions on the target's movement; 4.4 Remarks on programming of the ILRTA* and IMTS algorithms; 4.4.1 Data structures; 4.4.2 Operations and algorithms; 4.5 Summary; References; Chapter 5 Applications and perspectives; 5.1 Creating classification trees by using the recursive ILRTA* algorithm; 5.1.1 Recursive ILRTA* algorithm; 5.1.2 Recursive ILRTA* with weighted distances and simulation results; 5.2 Informational search and screening algorithm with single and multiple searchers
5.2.1 Definitions and assumptions
Record Nr. UNINA-9910139034303321
Kagan Eugene  
Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Probabilistic search for tracking targets : theory and modern application / / Eugene Kagan, Irad Ben-Gal
Autore Kagan Eugene
Pubbl/distr/stampa Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Descrizione fisica 1 online resource (348 p.)
Disciplina 658.5/3
670.285
Altri autori (Persone) Ben-GalIrad
Soggetto topico Search theory
Target acquisition - Mathematics
Motion - Mathematical models
ISBN 1-118-59659-5
1-118-59704-4
1-299-44937-9
1-118-59710-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover; Title Page; Copyright; Contents; List of figures; Preface; Notation and terms; Chapter 1 Introduction; 1.1 Motivation and applications; 1.2 General description of the search problem; 1.3 Solution approaches in the literature; 1.4 Methods of local search; 1.5 Objectives and structure of the book; References; Chapter 2 Problem of search for static and moving targets; 2.1 Methods of search and screening; 2.1.1 General definitions and notation; 2.1.2 Target location density for a Markovian search; 2.1.3 The search-planning problem; 2.2 Group-testing search
2.2.1 General definitions and notation2.2.2 Combinatorial group-testing search for static targets; 2.2.3 Search with unknown number of targets and erroneous observations; 2.2.4 Basic information theory search with known location probabilities; 2.3 Path planning and search over graphs; 2.3.1 General BF* and A* algorithms; 2.3.2 Real-time search and learning real-time A* algorithm; 2.3.3 Moving target search and the fringe-retrieving A* algorithm; 2.4 Summary; References; Chapter 3 Models of search and decision making; 3.1 Model of search based on MDP; 3.1.1 General definitions
3.1.2 Search with probabilistic and informational decision rules3.2 Partially observable MDP model and dynamic programming approach; 3.2.1 MDP with uncertain observations; 3.2.2 Simple Pollock model of search; 3.2.3 Ross model with single-point observations; 3.3 Models of moving target search with constrained paths; 3.3.1 Eagle model with finite and infinite horizons; 3.3.2 Branch-and-bound procedure of constrained search with single searcher; 3.3.3 Constrained path search with multiple searchers; 3.4 Game theory models of search; 3.4.1 Game theory model of search and screening
3.4.2 Probabilistic pursuit-evasion games3.4.3 Pursuit-evasion games on graphs; 3.5 Summary; References; Chapter 4 Methods of information theory search; 4.1 Entropy and informational distances between partitions; 4.2 Static target search: Informational LRTA* algorithm; 4.2.1 Informational LRTA* algorithm and its properties; 4.2.2 Group-testing search using the ILRTA* algorithm; 4.2.3 Search by the ILRTA* algorithm with multiple searchers; 4.3 Moving target search: Informational moving target search algorithm; 4.3.1 The informational MTS algorithm and its properties
4.3.2 Simple search using the IMTS algorithm4.3.3 Dependence of the IMTS algorithm's actions on the target's movement; 4.4 Remarks on programming of the ILRTA* and IMTS algorithms; 4.4.1 Data structures; 4.4.2 Operations and algorithms; 4.5 Summary; References; Chapter 5 Applications and perspectives; 5.1 Creating classification trees by using the recursive ILRTA* algorithm; 5.1.1 Recursive ILRTA* algorithm; 5.1.2 Recursive ILRTA* with weighted distances and simulation results; 5.2 Informational search and screening algorithm with single and multiple searchers
5.2.1 Definitions and assumptions
Record Nr. UNINA-9910813432503321
Kagan Eugene  
Chichester, West Sussex, United Kingdom : , : John Wiley & Sons Inc., , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui