Article

Free access

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

Authors:

Masfumi Yamashita,

Hideki Umemoto,

Ichiro Suzuki,

Tsunehiko KamedaAuthors Info & Claims

SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry

Pages 448 - 450

https://doi.org/10.1145/262839.263078

Published: 01 August 1997 Publication History

PDF eReader

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.

Crossref

Google Scholar

[2]

M. de Berg and R. Klein, private communication, 1993.

Google Scholar

[3]

C. Icking and R. Klein, "The two guards problem," in Proc. 7th A CM Syrup. on Computational Geometry, 1991, 166-175.

Digital Library

Google Scholar

[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.

Google Scholar

[5]

N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson and C.H. Papadimitriou, "The complexity of searching a graph," J. A CM 35, 1, 1988, 18-44.

Digital Library

Google Scholar

[6]

J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, Oxford, 1987.

Digital Library

Google Scholar

[7]

L.E. Parker, "Behavior-based cooperative robotics applied to multi-target observation," in Proc. Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robot Systems, Dagstuhl, Germany, September 1996.

Digital Library

Google Scholar

[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.

Google Scholar

[9]

K. Sugihara, I. Suzuki and M. Yamashita, "The searchlight scheduling problem," SIAM J. Computing 19, 6, 1990, 1024-1040.

Digital Library

Google Scholar

[10]

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM J. Computing $1,5, 1992, 868-888.

Digital Library

Google Scholar

[11]

H. Umemoto, Searching a Polygon by 1-Searchers, Master's Thesis, Department of Electrical Engineering, Hiroshima University, 1995.

Google Scholar

Cited By

View all

Khaluf YMathews ERammig F(2011)Self-Organized Cooperation in Swarm RoboticsProceedings of the 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops10.1109/ISORCW.2011.30(217-226)Online publication date: 28-Mar-2011
https://dl.acm.org/doi/10.1109/ISORCW.2011.30
Kolling ACarpin S(2010)Pursuit-evasion on trees by robot teamsIEEE Transactions on Robotics10.1109/TRO.2009.203573726:1(32-47)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1109/TRO.2009.2035737
Hladek DVascak JSincak P(2008)Positional Fuzzy Relations in Robot Control2008 IEEE International Conference on Computational Cybernetics10.1109/ICCCYB.2008.4721380(63-68)Online publication date: Nov-2008
https://doi.org/10.1109/ICCCYB.2008.4721380
Show More Cited By

Index Terms

Searching for mobile intruders in a polygonal region by a group of mobile searchers (extended abstract)
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Searching a polygonal region by a group of stationary k-searchers

We study the problem of searching for mobile intruders in a polygonal region by stationary searchers having various levels of vision given by the number of flashlights that a searcher carries. We show that (2<i>g</i> - 1) 1-searchers (i.e., 2<i>g</i> - ...
Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security
Performance optimization of region-based group key management in mobile ad hoc networks

We propose and analyse a scalable and efficient region-based group key management protocol for secure group communications in mobile ad hoc networks. For scalability and dynamic reconfigurability, we take a region-based approach by which group members ...

Comments

Information & Contributors

Information

Published In

SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry

August 1997

490 pages

ISBN:0897918789

DOI:10.1145/262839

Chairman:
Jean-Daniel Boissonnat
INRIA Sophia-Antipolis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG97

Sponsor:

SoCG97: 13th ACM Symposium on Computational Geometry

June 4 - 6, 1997

Nice, France

Acceptance Rates

SCG '97 Paper Acceptance Rate 75 of 199 submissions, 38%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
291
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khaluf YMathews ERammig F(2011)Self-Organized Cooperation in Swarm RoboticsProceedings of the 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops10.1109/ISORCW.2011.30(217-226)Online publication date: 28-Mar-2011
https://dl.acm.org/doi/10.1109/ISORCW.2011.30
Kolling ACarpin S(2010)Pursuit-evasion on trees by robot teamsIEEE Transactions on Robotics10.1109/TRO.2009.203573726:1(32-47)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1109/TRO.2009.2035737
Hladek DVascak JSincak P(2008)Positional Fuzzy Relations in Robot Control2008 IEEE International Conference on Computational Cybernetics10.1109/ICCCYB.2008.4721380(63-68)Online publication date: Nov-2008
https://doi.org/10.1109/ICCCYB.2008.4721380
Jung BSukhatme G(2006)Cooperative Multi-robot Target TrackingDistributed Autonomous Robotic Systems 710.1007/4-431-35881-1_9(81-90)Online publication date: 2006
https://doi.org/10.1007/4-431-35881-1_9
Jung BSukhatme G(2002)Tracking Targets Using Multiple RobotsAutonomous Robots10.1023/A:102059810767113:3(191-205)Online publication date: 1-Nov-2002
https://dl.acm.org/doi/10.1023/A%3A1020598107671
Tan X(2002)Searching a Simple Polygon by a k-SearcherAlgorithms and Computation10.1007/3-540-40996-3_43(503-514)Online publication date: 29-Jan-2002
https://doi.org/10.1007/3-540-40996-3_43
Park SLee JChwa K(2001)Visibility-Based Pursuit-Evasion in a Polygonal Region by a SearcherAutomata, Languages and Programming10.1007/3-540-48224-5_38(456-468)Online publication date: 4-Jul-2001
https://doi.org/10.1007/3-540-48224-5_38
Tan X(2001)Efficient Algorithms for Searching a Polygonal Room with a DoorDiscrete and Computational Geometry10.1007/3-540-47738-1_32(339-350)Online publication date: 20-Sep-2001
https://doi.org/10.1007/3-540-47738-1_32
LaValle SSimov BSlutzki GCheng SCheong OAgarwal PFortune S(2000)An algorithm for searching a polygonal region with a flashlightProceedings of the sixteenth annual symposium on Computational geometry10.1145/336154.336212(260-269)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/336154.336212
Lee JShin SChwa KMilenkovic V(1999)Visibility-based pursuit-evasion in a polygonal room with a doorProceedings of the fifteenth annual symposium on Computational geometry10.1145/304893.304981(281-290)Online publication date: 13-Jun-1999
https://dl.acm.org/doi/10.1145/304893.304981

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Searching a polygonal region by a group of stationary k-searchers

Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security

Performance optimization of region-based group key management in mobile ad hoc networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Searching a polygonal region by a group of stationary k-searchers

Securing Mobile Ad Hoc Networks: Resource-Aware Self-Adaptive Security

Performance optimization of region-based group key management in mobile ad hoc networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations