A symbolic programming approach to the rendezvous search problem
From MaRDI portal
Publication:2120120
DOI10.1007/s43069-022-00122-2zbMath1484.91005OpenAlexW4210722605MaRDI QIDQ2120120
Publication date: 31 March 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-022-00122-2
symbolic programmingenumeration of optimal strategiesrendezvous search game on the linerendezvous with markers
Symbolic computation and algebraic computation (68W30) 2-person games (91A05) Algorithmic game theory and complexity (91A68)
Cites Work
- Unnamed Item
- Decision procedures. An algorithmic point of view
- Rendezvous search on a star graph with examination costs
- An annotated bibliography on guaranteed graph searching
- The theory of search games and rendezvous.
- Linear search by a pair of distinct-speed robots
- Search on a line with faulty robots
- Graph exploration by energy-sharing mobile agents
- Search-and-rescue rendezvous
- Rendezvous Search on the Interval and the Circle
- SEARCH GAMES: LITERATURE AND SURVEY
- Optimal Symmetric Rendezvous Search on Three Locations
- Rendezvous search with markers that can be dropped at chosen times
- Improved Bounds for the Symmetric Rendezvous Value on the Line
- Flocking and Rendezvous in Distributed Robotics
- Two Dimensional Rendezvous Search
- Rendezvous Search: A Personal Perspective
- Rendezvous Search on the Labeled Line
- Symbolic execution and program testing
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- Rendezvous search when marks are left at the starting points
- Rendezvous search on labeled networks
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- Rendezvous Search on the Line
- Rendezvous in Distributed Systems
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Search Theory
- Group Search on the Line
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- The rendezvous problem on discrete locations
- LATIN 2004: Theoretical Informatics
This page was built for publication: A symbolic programming approach to the rendezvous search problem
