Nyhet

Multi-Agent Search under Uncertainty

Reactive and Deep Q-Learning Methods

AvBarouch Matzliach,Evgeny Kagan

Inbunden, Engelska, 2026

1 658 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

Plan optimal multi-robot search paths despite imperfect sensor information When multiple robots must locate targets in presence of false positive and false negative detection errors, path planning becomes extraordinarily complex. Multi-Agent Search under Uncertainty addresses this challenge directly. Written by researchers with combined expertise spanning defense systems, applied mathematics, and machine learning, this book delivers both theoretical foundations in search and screening theory and ready-to-use algorithms for practical implementation. The book covers cooperative search and navigation methods for autonomous mobile agents operating with incomplete or noisy information. Readers learn how Deep Q-Learning enables robots to develop complex behaviors through trial-and-error interactions rather than pre-programmed instructions. Applications span search and rescue operations, military surveillance, environmental monitoring, and security systems. An accompanying website provides Python code for simulation practice. Key topics include: Value-based Q-Learning methods where robots learn expected rewards for specific actions in given states under sensor uncertainty conditionsMulti-agent reinforcement learning approaches for swarm robotics where multiple robots learn cooperatively to accomplish collaborative search tasksDeep reinforcement learning using neural networks to process high-dimensional sensory inputs and execute complex search and tracking behaviorsAlgorithms for finding and tracking both stationary and moving targets while minimizing detection time despite false negative and positive readingsTheoretical contributions to search and screening theory alongside practical algorithms validated in autonomous robotic systems developmentDesigned for graduate students and researchers in robotics and reinforcement learning, this book bridges advanced theory with practical application. Professional developers building autonomous systems will find algorithms tested in real-world robotic development.

Produktinformation

Utgivningsdatum:2026-10-08
Mått:178 x 254 x 10 mm
Vikt:449 g
Format:Inbunden
Språk:Engelska
Antal sidor:128
Upplaga:26001
Förlag:John Wiley & Sons Inc
ISBN:9781394418459

Utforska kategorier

Teknik: allmänt inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Mer om författaren

Barouch Matzliach, PhD, is a Lecturer at Tel Aviv University, Faculty of Engineering, and a technology consultant to defense industries. He has thirty years of experience in the development and production of advanced land combat systems and is a recipient of the Israel Defense Award. His research at the LAMBDA laboratory focuses on Multi-Agent Reinforcement Learning and autonomous AI applications. Evgeny Kagan, PhD, CandSc-Eng, is a Senior Lecturer at the Department of Industrial Engineering, Ariel University, and a Research Fellow at LAMBDA laboratory. With over thirty years of experience in applied mathematics and engineering, he has authored more than eighty scientific publications including four books. Irad Ben-Gal, PhD, is a Full Professor at the Faculty of Engineering and a head of LAMBDA laboratory at Tel Aviv University and a world-renowned expert in data science, AI, and machine learning with over twenty-five years of academic and practical experience. He co-heads the TAU/Stanford University Digital Living 2030 initiative, has published four books, more than 150 scientific papers and patents, and has collaborated with Oracle, Intel, GM, AT&T, Applied Materials, Siemens, Kimberly Clark and Nokia.

Innehållsförteckning

Preface ixAbout the Companion Website xi1 Introduction 11.1 The Problem of Search Under Uncertainty 11.2 Book Objectives and Main Contributions 21.3 Structure of the Book 32 Background 52.1 Probabilistic Search for Static and Moving Targets 62.2 Search in Shadowed Space 102.3 Search with False-Positive and False-Negative Errors 162.4 Conclusions 193 Problem Formulation and Basic Search Procedure 213.1 Basic Assumptions 213.2 Sensor's Fusion and Dynamic Probability Map 243.3 Search Policy and Sensing 263.3.1 Search Policy 263.3.2 Search Time and Sensors' Sensitivity 273.3.3 Numerical Simulations 283.4 Conclusions 304 Reactive Detection Algorithms 314.1 Agents' Policies and Decision-making 314.2 Policies Control and Brute-Force Learning 344.3 Numerical Simulations 354.3.1 Detection by a Single Agent 364.3.2 Detection by Multiple Agents 384.4 Conclusions 425 Search with Learning 435.1 Reinforcement Learning 435.2 Search with Supervised and Unsupervised Learning 475.3 Two-Actor Search 505.3.1 Pursuit-Evasion Game 515.3.2 Actor-Critic Approach 525.4 Conclusions 536 Search with Deep Q-Learning: Single Agent 556.1 Problem Formulation and Notation 556.2 Decision-making Policy and Deep Q-Learning Solution 586.2.1 Agent's Actions and Decision-making 586.2.2 Dynamic Programming and Target Neural Networks 596.2.3 Model-Free and Model-Based Learning 606.2.4 Choice of the Actions at the Learning Stage 636.2.5 The Q-max Algorithm 636.2.6 The SPL Algorithm 676.3 Numerical Simulations 676.3.1 Network Training in the Q-max Algorithm 686.3.2 Detection by the Q-max and SPL Algorithms 696.3.3 Comparison Between Q-max and SPL Algorithms and One-Step Heuristics 696.3.4 Comparison Between SPL Algorithm and Optimal Solution 736.3.5 Run Times and Mean-Squared Errors for Different Sizes of Data Sets 756.4 Conclusions 767 Search with Deep Q-learning: Multiple Agents 777.1 Problem Formulation and Notation 777.2 Cooperative Detection Using Voronoi Regions and Deep Q-Learning 787.2.1 Agents' Actions and Decision-making 797.2.2 Reactive Decision-making in Voronoi Regions: A Distributed EIG Algorithm 797.2.3 Collective Deep Q-Learning Approach 817.3 Numerical Simulations 887.3.1 Detection of Static Targets 897.3.2 Detection of Moving Targets 927.3.3 Learning Errors and Run Time of the Collective Q-max Algorithm 947.4 Conclusions 958 Conclusions 97References 99Index 103