On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous

DOI10.1287/moor.2014.0680zbMath1348.49016OpenAlexW2123124876MaRDI QIDQ5245013

Ching-Min Lien, Cheng-Shang Chang, Wanjiun Liao

Publication date: 1 April 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/03f32a3f9bcdcc03336e333c8925daf1f5e8a778

zbMATH Keywords

constrained optimizationorthogonal Latin squarescognitive radio networksfinite projective planesrendezvous searchrandom hopping sequences

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Orthogonal arrays, Latin squares, Room squares (05B15) Stochastic processes (60G99) Combinatorial structures in finite projective spaces (51E20) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (5)

A symbolic programming approach to the rendezvous search problem ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ A search problem on a bipartite network ⋮ Search-and-rescue rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times

Cites Work

• Unnamed Item
• The theory of search games and rendezvous.
• Asynchronous deterministic rendezvous in graphs
• Deterministic rendezvous in graphs
• Rendezvous Search on the Interval and the Circle
• Optimal Symmetric Rendezvous Search on Three Locations
• Rendezvous in Higher Dimensions
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case
• Two Dimensional Rendezvous Search
• Rendezvous Search on the Labeled Line
• Boole-Bonferroni Inequalities and Linear Programming
• On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function
• Optical orthogonal codes: design, analysis and applications
• The Search for a Finite Projective Plane of Order 10
• Rendezvous search on a graph
• Rendezvous search on labeled networks
• Rendezvous Search on the Line
• The Rendezvous Search Problem
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• Rendezvous on a Planar Lattice
• The rendezvous problem on discrete locations
• Inequalities: theory of majorization and its applications

This page was built for publication: On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous