Searching in the plane
From MaRDI portal
Publication:690242
Recommendations
Cited in
(only showing first 100 items - show all)- Classifying the multi robot path finding problem into a quadratic competitive complexity class
- Ranking hypotheses to minimize the search cost in probabilistic inference models
- How to find a point on a line within a fixed distance
- An improved approximation ratio for the minimum latency problem
- Autonomous search for mines
- Agent searching in a tree and the optimality of iterative deepening
- Searching with mobile agents in networks with liars.
- Flood search under the California split rule.
- Searching and on-line recognition of star-shaped polygons.
- A general framework for searching on a line
- Evacuating two robots from multiple unknown exits in a circle
- Online buffer management for transmitting packets with processing cycles
- The expanding search ratio of a graph
- Linear search by a pair of distinct-speed robots
- Online matching on a line
- Reaching a target in the plane with no information
- Optimal robot localization in trees
- The power of a pebble: Exploring and mapping directed graphs
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
- Competitive online routing in geometric graphs
- The weighted 2-server problem
- Parallel searching in the plane
- Competitive distributed decision-making
- Online graph exploration: New results on old and new algorithms
- Lower bounds for searching robots, some faulty
- Search on a line with faulty robots
- Advice complexity of treasure hunt in geometric terrains
- Weighted group search on a line \& implications to the priority evacuation problem
- Graph exploration by energy-sharing mobile agents
- Pebble guided near optimal treasure hunt in anonymous graphs
- Further connections between contract-scheduling and ray-searching problems
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
- Leaves on the line and in the plane
- Deterministic treasure hunt in the plane with angular hints
- Priority evacuation from a disk: the case of \(n \geq 4\)
- A tight lower bound for semi-synchronous collaborative grid exploration
- Treasure evacuation with one robot on a disk
- Beachcombing on strips and islands
- Searching for a non-adversarial, uncooperative agent on a cycle
- Priority evacuation from a disk: the case of \(n = 1,2,3\)
- Greedy metric minimum online matchings with random arrivals
- Rendezvous in planar environments with obstacles and unknown initial distance
- Group search of the plane with faulty robots
- Walking in streets with minimal sensing
- Fast rendezvous on a cycle by agents with different speeds
- Multi-processor search and scheduling problems with setup cost
- The ANTS problem
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Multi-target ray searching problems
- Online searching with turn cost
- Honey-pot constrained searching with local sensory information
- Searching on a line: a complete characterization of the optimal solution
- Search for the wreckage of Air France Flight AF 447
- Convergecast and broadcast by power-aware mobile agents
- Online search for a hyperplane in high-dimensional Euclidean space
- Pebble guided optimal treasure hunt in anonymous graphs
- Evacuating from \(\ell_p\) unit disks in the wireless model
- Optimal distributed searching in the plane with and without uncertainty
- A general framework for searching on a line
- Linear search by a pair of distinct-speed robots
- Walking in Streets with Minimal Sensing
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Search games: a review
- Online Graph Exploration: New Results on Old and New Algorithms
- scientific article; zbMATH DE number 4133805 (Why is no real title available?)
- Multidimensional online motion planning for a spherical robot
- Deterministic Meeting of Sniffing Agents in the Plane*
- Optimal search for parameters in Monte Carlo simulation for derivative pricing
- Treasure hunt with barely communicating agents
- God save the queen
- Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Treasure hunt with advice
- Competitive complexity of mobile robot on-line motion planning problems
- scientific article; zbMATH DE number 4062645 (Why is no real title available?)
- Pessimal guesses may be optimal: a counterintuitive search result
- Learning heuristic functions for large state spaces
- Competitive Algorithms for Layered Graph Traversal
- Searching for an axis-parallel shoreline
- Online algorithms for searching and exploration in the plane
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Walking streets faster
- Lower bounds in on-line geometric searching metric searching
- Querying with Uncertainty
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle
- Going home through an unknown street
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- scientific article; zbMATH DE number 7559116 (Why is no real title available?)
- A tight lower bound for semi-synchronous collaborative grid exploration
- scientific article; zbMATH DE number 7561402 (Why is no real title available?)
- Competitive Searching for a Line on a Line Arrangement.
- Linear rendezvous with asymmetric clocks
- Energy consumption of group search on a line
- An improved online algorithm for the traveling repairperson problem on a line
- Position-independent near optimal searching and on-line recognition in star polygons
- Infinite linear programming and online searching with turn cost
- Linear Search with Terrain-Dependent Speeds
- Finding defectives on a line by random docking and interval group tests
This page was built for publication: Searching in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690242)
