scientific article; zbMATH DE number 1003229
From MaRDI portal
Publication:4335188
zbMath1114.68555MaRDI QIDQ4335188
Publication date: 16 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Competitive exploration of rectilinear polygons ⋮ On-line parallel heuristics, processor scheduling and robot searching under the competitive framework ⋮ Walking streets faster ⋮ Lower bounds in on-line geometric searching metric searching ⋮ Going home through an unknown street ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ Online exploration outside a convex obstacle ⋮ Position-independent near optimal searching and on-line recognition in star polygons ⋮ Optimality and competitiveness of exploring polygons by mobile robots ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Search on a Line by Byzantine Robots ⋮ Search and rescue on the line ⋮ Online algorithms for searching and exploration in the plane ⋮ Searching and on-line recognition of star-shaped polygons. ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Agent search in uniform b-ary trees: Multiple goals and unequal costs ⋮ Search on a line with faulty robots ⋮ An optimal online algorithm for halfplane intersection ⋮ On-line path planning in an unknown polygonal environment ⋮ Parallel searching on \(m\) rays ⋮ Competitive searching in polygons—Beyond generalised streets ⋮ Weighted nearest neighbor algorithms for the graph exploration problem on cycles ⋮ Energy Consumption of Group Search on a Line ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Polygon exploration with time-discrete vision ⋮ Group search of the plane with faulty robots ⋮ Walking in Streets with Minimal Sensing ⋮ Walking in streets with minimal sensing ⋮ Graph exploration by energy-sharing mobile agents
This page was built for publication:
