Searching for mobile intruders in a polygonal region by a group of mobile searchers (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Searching for mobile intruders in a polygonal region by a group of mobile searchers (extended abstract)

Full text

Pdf (725 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents

Nice, France

Pages: 448 - 450

Year of Publication: 1997

ISBN:0-89791-878-9

Authors

Masfumi Yamashita	Department of Electrical Engineering, Faculty of Engineering, Hiroshima University, Kagamiyama, Higashi-Hiroshima 739, Japan
Hideki Umemoto	Technology Center, Anritsu Corporation, Onna, Atsugi 243, Japan
Ichiro Suzuki	Department of Electrical Engineering and Computer Science, University of Wisconsin - Milwaukee, P.O. Box 784, Milwaukee, WI
Tsunehiko Kameda	School of Computing Science, Simon Fraser University, Burnaby, B.C., V5A 1S6, Canada

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.263078 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Crass, I. Suzuki and M. Yamashita, "Seaxching for a mobile intruder in a corridor - The open edge variant of the polygon search problem," International J. Computational Geometry and Applications 5, 4, 1995, 397-412.
	2	M. de Berg and R. Klein, private communication, 1993.
	3	Christian Icking , Rolf Klein, The two guards problem, Proceedings of the seventh annual symposium on Computational geometry, p.166-175, June 10-12, 1991, North Conway, New Hampshire, United States [doi>10.1145/109648.109667]
	4	S.M. LaValle, D. Lin, L.J. Guibas, J.-C. Latombe and R. Motwani, "Finding an unpredictable target in a workspace with obstacles," in Proc. IEEE International Con}. Robotics and Automation, April 1997, to appear.
	5	N. Megiddo , S. L. Hakimi , M. R. Garey , D. S. Johnson , C. H. Papadimitriou, The complexity of searching a graph, Journal of the ACM (JACM), v.35 n.1, p.18-44, Jan. 1988 [doi>10.1145/42267.42268]
	6	Joseph O'Rourke, Art gallery theorems and algorithms, Oxford University Press, Inc., New York, NY, 1987
	7	Lynne E. Parker, Behavior-Based Cooperative Robotics Applied to Multi-Target Observation, Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996], p.356-373, September 01-06, 1996
	8	T.D. Parsons, "Pursuit-evasion in a graph," in Theory and Applications o} Graphs, Y. Alavi and D. Lick (eds.), Lecture Notes in Mathematics 642, Springer- Verlag, Berlin, 1976, 426-441.
	9	Kazuo Sugihara , Ichiro Suzuki , Masafumi Yamashita, The searchlight scheduling problem, SIAM Journal on Computing, v.19 n.6, p.1024-1040, Dec. 1990 [doi>10.1137/0219070]
	10	Ichiro Suzuki , Masafumi Yamashita, Searching for a mobile intruder in a polygonal region, SIAM Journal on Computing, v.21 n.5, p.863-888, Oct. 1992 [doi>10.1137/0221051]
	11	H. Umemoto, Searching a Polygon by 1-Searchers, Master's Thesis, Department of Electrical Engineering, Hiroshima University, 1995.

CITED BY 3

	Steven M. LaValle , Borislav H. Simov , Giora Slutzki, An algorithm for searching a polygonal region with a flashlight, Proceedings of the sixteenth annual symposium on Computational geometry, p.260-269, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong
	Jae-Ha Lee , Sung Yong Shin , Kyung-Yong Chwa, Visibility-based pursuit-evasion in a polygonal room with a door, Proceedings of the fifteenth annual symposium on Computational geometry, p.281-290, June 13-16, 1999, Miami Beach, Florida, United States
	Boyoon Jung , Gaurav S. Sukhatme, Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion, Autonomous Robots, v.13 n.3, p.191-205, November 2002