an annotated bibliography on guaranteed graph searching

Graph Searching Games and Width Measures for Directed Graphs

Authors saeed akhoondian amiri , lukasz kaiser , stephan kreutzer , roman rabinovich , sebastian siebertz.

• Part of: Volume: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015) Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs) Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)

• Publication Date: 2015-02-26

• Filesize: 0.66 MB

Document Identifiers

• DOI: 10.4230/LIPIcs.STACS.2015.34
• URN: urn:nbn:de:0030-drops-49020

Author Details

Cite as get bibtex.

• cops and robber games
• directed graphs
• Access Statistics
• Total Accesses (updated on a weekly basis) 0 PDF Downloads 0 Metadata Views

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Could not send message.

How to Prepare an Annotated Bibliography: The Annotated Bibliography

• The Annotated Bibliography
• Fair Use of this Guide

Explanation, Process, Directions, and Examples

What is an annotated bibliography.

An annotated bibliography is a list of citations to books, articles, and documents. Each citation is followed by a brief (usually about 150 words) descriptive and evaluative paragraph, the annotation. The purpose of the annotation is to inform the reader of the relevance, accuracy, and quality of the sources cited.

Annotations vs. Abstracts

Abstracts are the purely descriptive summaries often found at the beginning of scholarly journal articles or in periodical indexes. Annotations are descriptive and critical; they may describe the author's point of view, authority, or clarity and appropriateness of expression.

The Process

Creating an annotated bibliography calls for the application of a variety of intellectual skills: concise exposition, succinct analysis, and informed library research.

First, locate and record citations to books, periodicals, and documents that may contain useful information and ideas on your topic. Briefly examine and review the actual items. Then choose those works that provide a variety of perspectives on your topic.

Cite the book, article, or document using the appropriate style.

Write a concise annotation that summarizes the central theme and scope of the book or article. Include one or more sentences that (a) evaluate the authority or background of the author, (b) comment on the intended audience, (c) compare or contrast this work with another you have cited, or (d) explain how this work illuminates your bibliography topic.

Critically Appraising the Book, Article, or Document

For guidance in critically appraising and analyzing the sources for your bibliography, see How to Critically Analyze Information Sources . For information on the author's background and views, ask at the reference desk for help finding appropriate biographical reference materials and book review sources.

Choosing the Correct Citation Style

Check with your instructor to find out which style is preferred for your class. Online citation guides for both the Modern Language Association (MLA) and the American Psychological Association (APA) styles are linked from the Library's Citation Management page .

Sample Annotated Bibliography Entries

The following example uses APA style ( Publication Manual of the American Psychological Association , 7th edition, 2019) for the journal citation:

Waite, L., Goldschneider, F., & Witsberger, C. (1986). Nonfamily living and the erosion of traditional family orientations among young adults. American Sociological Review, 51 (4), 541-554. The authors, researchers at the Rand Corporation and Brown University, use data from the National Longitudinal Surveys of Young Women and Young Men to test their hypothesis that nonfamily living by young adults alters their attitudes, values, plans, and expectations, moving them away from their belief in traditional sex roles. They find their hypothesis strongly supported in young females, while the effects were fewer in studies of young males. Increasing the time away from parents before marrying increased individualism, self-sufficiency, and changes in attitudes about families. In contrast, an earlier study by Williams cited below shows no significant gender differences in sex role attitudes as a result of nonfamily living.

This example uses MLA style ( MLA Handbook , 9th edition, 2021) for the journal citation. For additional annotation guidance from MLA, see 5.132: Annotated Bibliographies .

Waite, Linda J., et al. "Nonfamily Living and the Erosion of Traditional Family Orientations Among Young Adults." American Sociological Review, vol. 51, no. 4, 1986, pp. 541-554. The authors, researchers at the Rand Corporation and Brown University, use data from the National Longitudinal Surveys of Young Women and Young Men to test their hypothesis that nonfamily living by young adults alters their attitudes, values, plans, and expectations, moving them away from their belief in traditional sex roles. They find their hypothesis strongly supported in young females, while the effects were fewer in studies of young males. Increasing the time away from parents before marrying increased individualism, self-sufficiency, and changes in attitudes about families. In contrast, an earlier study by Williams cited below shows no significant gender differences in sex role attitudes as a result of nonfamily living.

Versión española

Tambíen disponible en español: Cómo Preparar una Bibliografía Anotada

Content Permissions

If you wish to use any or all of the content of this Guide please visit our Research Guides Use Conditions page for details on our Terms of Use and our Creative Commons license.

Reference Help

• Next: Fair Use of this Guide >>
• Last Updated: Sep 29, 2022 11:09 AM
• URL: https://guides.library.cornell.edu/annotatedbibliography

• Finding Sources
• Writing the Annotations
• Formatting the Annotated Bibliography
• Citation This link opens in a new window

What is an Annotated Bibliography?

An annotated bibliography is a list of sources in proper citation format, each with a descriptive paragraph. The description may critique, analyze or just summarize the content of the item. For this assignment,  you will write a critical/evaluative annotation for each source, critically appraising the evidence that addresses your practice problem. 

A good annotated bibliography:

• Encourages you to think critically about the content of the works you are using, the importance of the works within the field of study, and the relation of the works to your own research and ideas
• Proves you have read and understand your sources
• Establishes your work as a valid source and you as a competent researcher
• Provides a way for others to decide whether a source will be helpful to their research if they read it

*Excerpted from The Writing Center, University of North Carolina at Chapel Hill .

The Annotated Bibliography should be the final result after a thorough review of the literature on your topic. Different databases should be searched to get different perspectives. If 8-10 sources are required, you should be reviewing many more sources (20-25), in detail,  before making final selections.

Steps to Writing an Annotated Bibliography

No matter which course or discipline you're researching in, the steps of writing an annotated bibliography should be similar:

• Research, identify, locate and read scholarly and professional articles, books, and documents for your bibliography
• Critically screen, analyze and evaluate the sources
• organize the sources in a logical order
• Create citations in proper APA format (see APA tab)
• Compose annotations

Resources on the Web

For more information on annotated bibliographies, visit these pages:

• Writing an Annotated Bibliography Dena Taylor, Health Sciences Writing Centre, University of Toronto
• Annotated Bibliographies The Writing Center, University of North Carolina at Chapel Hill
• Next: Finding Sources >>
• Last Updated: May 7, 2024 6:08 PM
• URL: https://stevenson.libguides.com/annotatedbib

Advertisement

GSST: anytime guaranteed search

• Published: 23 April 2010
• Volume 29 , pages 99–118, ( 2010 )

Cite this article

• Geoffrey Hollinger 1 ,
• Athanasios Kehagias 2 &
• Sanjiv Singh 1  

310 Accesses

19 Citations

Explore all metrics

We present Guaranteed Search with Spanning Trees (GSST), an anytime algorithm for multi-robot search. The problem is as follows: clear the environment of any adversarial target using the fewest number of searchers. This problem is NP-hard on arbitrary graphs but can be solved in linear-time on trees. Our algorithm generates spanning trees of a graphical representation of the environment to guide the search. At any time, spanning tree generation can be stopped yielding the best strategy so far. The resulting strategy can be modified online if additional information becomes available. Though GSST does not have performance guarantees after its first iteration, we prove that several variations will find an optimal solution given sufficient runtime. We test GSST in simulation and on a human-robot search team using a distributed implementation. GSST quickly generates clearing schedules with as few as 50% of the searchers used by competing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price includes VAT (Russian Federation)

Instant access to the full article PDF.

Rent this article via DeepDyve

Institutional subscriptions

Similar content being viewed by others

Average case constant factor time and distance optimal multi-robot path planning in well-connected environments

Asymptotically Optimal Path Planning for Robotic Manipulators: Multi-Directional, Multi-Tree Approach

M*: A Complete Multirobot Path Planning Algorithm with Optimality Bounds

Alspach, B. (2006). Searching and sweeping graphs: a brief survey. Matematiche , 59 , 5–37.

MathSciNet   Google Scholar  

Barrière, L., Flocchini, P., Fraigniaud, P., & Santoro, N. (2002). Capture of an intruder by mobile agents. In Proc. 14th ACM symp. parallel algorithms and architectures (pp. 200–209).

Barrière, L., Fraigniaud, P., Santoro, N., & Thilikos, D. (2003). Searching is not jumping. Graph-Theoretic Concepts in Computer Science , 2880 , 34–45.

Google Scholar  

Bienstock, D., & Seymour, P. (1991). Monotonicity in graph searching. Journal of Algorithms , 12 (2), 239–245.

Article   MATH   MathSciNet   Google Scholar  

Char, J. (1968). Generation of trees, two-trees, and storage of master forests. IEEE Transactions on Circuit Theory , 15 (3), 228–238.

Article   MathSciNet   Google Scholar  

Dendris, N., Kirousis, L., & Thilikos, D. (1994). Fugitive-search games on graphs and related parameters. In Proc. 20th int. workshop graph-theoretic concepts in computer science (pp. 331–342).

Flocchini, P., Nayak, A., & Schulz, A. (2005). Cleaning an arbitrary regular network with mobile agents. In Proc. int. conf. distributed computing and Internet technology (pp. 132–142).

Flocchini, P., Huang, M., & Luccio, F. (2007). Decontamination of chordal rings and tori using mobile agents. International Journal of Foundations of Computer Science , 18 (3), 547–564.

Flocchini, P., Huang, M., & Luccio, F. (2008). Decontamination of hypercubes by mobile agents. Networks , 52 (3), 167–178.

Fomin, F., & Thilikos, D. (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science , 399 , 236–245.

Fomin, F., Fraigniaud, P., & Thilikos, D. (2004). The price of connectedness in expansions . Technical Report LSI-04-28-R, UPC Barcelona.

Fraigniaud, P., & Nisse, N. (2006). Connected treewidth and connected graph searching. In Proc. 7th Latin American symp. theoretical informatics .

Gerkey, B. (2004). Pursuit-evasion with teams of robots. http://ai.stanford.edu/~gerkey/research/pe/index.html .

Gerkey, B., Vaughan, R., & Howard, A. (2003). The player/stage project: tools for multi-robot and distributed sensor systems. In Proc. int. conf. advanced robotics (pp. 317–323).

Gerkey, B., Thrun, S., & Gordon, G. (2005). Parallel stochastic hill-climbing with small teams. In Proc. 3rd int. NRL workshop multi-robot systems .

Guibas, L., Latombe, J., LaValle, S., Lin, D., & Motwani, R. (1999). Visibility-based pursuit-evasion in a polygonal environment. International Journal of Computational Geometry and Applications , 9 (5), 471–494.

Hollinger, G., Kehagias, A., & Singh, S. (2009a). Efficient, guaranteed search with multi-agent teams. In Proc. robotics: science and systems conf .

Hollinger, G., Singh, S., Djugash, J., & Kehagias, A. (2009b). Efficient multi-robot search for a moving target. International Journal of Robotics Research , 28 (2), 201–219.

Article   Google Scholar  

Isler, V., Kannan, S., & Khanna, S. (2005). Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics , 21 (5), 875–884.

Kalra, N. (2006). A market-based framework for tightly-coupled planned coordination in multirobot teams . Ph.D. thesis, Robotics Institute, Carnegie Mellon Univ.

Kehagias, A., Hollinger, G., & Gelastopoulos, A. (2009a). Searching the nodes of a graph: theory and algorithms . Technical Report arXiv:0905.3359 [cs.DM].

Kehagias, A., Hollinger, G., & Singh, S. (2009b). A graph search algorithm for indoor pursuit/evasion. Mathematical and Computer Modelling , 50 (9–10), 1305–1317.

Kloks, T. (1994). Treewidth: computations and approximations . Berlin: Springer.

MATH   Google Scholar  

Kolling, A., & Carpin, S. (2008). Extracting surveillance graphs from robot maps. In Proc. int. conf. intelligent robots and systems .

Kolling, A., & Carpin, S. (2010). Pursuit-evasion on trees by robot teams. IEEE Transactions on Robotics , 26 , 32–47.

Kumar, V., Rus, D., & Singh, S. (2004). Robot and sensor networks for first responders. Pervasive Computing , 3 (4), 24–33.

LaPaugh, A. (1993). Recontamination does not help to search a graph. Journal of ACM , 40 (2), 224–245.

LaValle, S. M. (2006). Planning algorithms . Cambridge: Cambridge University Press.

Book   MATH   Google Scholar  

LaValle, S., Lin, D., Guibas, L., Latombe, J., & Motwani, R. (1997). Finding an unpredictable target in a workspace with obstacles. In Proc. IEEE international conf. robotics and automation .

Likhachev, M., Ferguson, D., Gordon, G., Stentz, A., & Thrun, S. (2005). Anytime dynamic A*: an anytime, replanning algorithm. In Proc. int. conf. automated planning and scheduling .

Megiddo, N., Hakimi, S., Garey, M., Johnson, D., & Papadimitriou, C. (1988). The complexity of searching a graph. Journal of ACM , 35 (1), 18–44.

Parsons, T. (1976). Pursuit-evasion in a graph. In Y. Alavi, & D. Lick (Eds.) Theory and applications of graphs (pp. 426–441). Berlin: Springer.

Shewchuk, J. (2002). Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications , 22 (1–3), 21–74.

MATH   MathSciNet   Google Scholar  

Smith, T. (2007). Probabilistic planning for robotic exploration . Ph.D. thesis, Robotics Institute, Carnegie Mellon Univ.

Wilson, D. (1996). Generating random spanning trees more quickly than the cover time. In Proc. 28th ACM symp. theory of computing (pp. 296–303).

Yang, B., Dyer, D., & Alspach, B. (2004). Sweeping graphs with large clique number. In Proc. 5th international symp. algorithms and computation (pp. 908–920).

Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. Artificial Intelligence Magazine , 17 (3), 73–86.

Download references

Author information

Authors and affiliations.

Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, 15217, USA

Geoffrey Hollinger & Sanjiv Singh

Faculty of Engineering, Aristotle University of Thessaloniki, Box 464, Thessaloniki, 54124, Greece

Athanasios Kehagias

You can also search for this author in PubMed   Google Scholar

Corresponding author

Correspondence to Geoffrey Hollinger .

Electronic Supplementary Material

Below are the links to the electronic supplementary material.

(MP4 8,153 KB)

(MP4 5,321 KB)

Rights and permissions

Reprints and permissions

About this article

Hollinger, G., Kehagias, A. & Singh, S. GSST: anytime guaranteed search. Auton Robot 29 , 99–118 (2010). https://doi.org/10.1007/s10514-010-9189-9

Download citation

Received : 31 May 2009

Accepted : 07 April 2010

Published : 23 April 2010

Issue Date : July 2010

DOI : https://doi.org/10.1007/s10514-010-9189-9

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Multi-robot coordination
• Graph search
• Anytime algorithms
• Decentralized computation
• Pursuit/evasion
• Find a journal
• Publish with us
• Track your research