Literatura académica sobre el tema "Pursuit-evasion"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Pursuit-evasion".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Pursuit-evasion"
Scott, Allan y Ulrike Stege. "Parameterized pursuit-evasion games". Theoretical Computer Science 411, n.º 43 (octubre de 2010): 3845–58. http://dx.doi.org/10.1016/j.tcs.2010.07.004.
Texto completoFeng, Yanghe, Lanruo Dai, Jinwu Gao y Guangquan Cheng. "Uncertain pursuit-evasion game". Soft Computing 24, n.º 4 (12 de diciembre de 2018): 2425–29. http://dx.doi.org/10.1007/s00500-018-03689-3.
Texto completoADLER, MICAH, HARALD RCKE, NAVEEN SIVADASAN, CHRISTIAN SOHLER y BERTHOLD VCKING. "Randomized Pursuit-Evasion in Graphs". Combinatorics, Probability and Computing 12, n.º 3 (mayo de 2003): 225–44. http://dx.doi.org/10.1017/s0963548303005625.
Texto completoLehner, Florian. "Pursuit evasion on infinite graphs". Theoretical Computer Science 655 (diciembre de 2016): 30–40. http://dx.doi.org/10.1016/j.tcs.2016.04.024.
Texto completoMerz, A. W. "Noisy satellite pursuit-evasion guidance". Journal of Guidance, Control, and Dynamics 12, n.º 6 (noviembre de 1989): 901–5. http://dx.doi.org/10.2514/3.20498.
Texto completoChung, F. R. K., Joel E. Cohen y R. L. Graham. "Pursuit—Evasion games on graphs". Journal of Graph Theory 12, n.º 2 (1988): 159–67. http://dx.doi.org/10.1002/jgt.3190120205.
Texto completoGutman, S., M. Esh y M. Gefen. "Simple linear pursuit-evasion games". Computers & Mathematics with Applications 13, n.º 1-3 (1987): 83–95. http://dx.doi.org/10.1016/0898-1221(87)90095-2.
Texto completoMycielski, J. "Theories of pursuit and evasion". Journal of Optimization Theory and Applications 56, n.º 2 (febrero de 1988): 271–84. http://dx.doi.org/10.1007/bf00939412.
Texto completoMycielski, J. "Theories of pursuit and evasion". Journal of Optimization Theory and Applications 61, n.º 1 (abril de 1989): 147. http://dx.doi.org/10.1007/bf00940851.
Texto completoKlein, Kyle y Subhash Suri. "Pursuit Evasion on Polyhedral Surfaces". Algorithmica 73, n.º 4 (29 de abril de 2015): 730–47. http://dx.doi.org/10.1007/s00453-015-9988-7.
Texto completoTesis sobre el tema "Pursuit-evasion"
Li, Dongxu. "Multi-player pursuit-evasion differential games". Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1164738831.
Texto completoPrasad, Deepika. "Pursuit Evasion From Multiple Pursuers Using Speed Fluctuation". University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367928486.
Texto completoSoares, Ronan Pardo. "Pursuit-evasion games, decompositions and convexity on graphs". Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=11105.
Texto completoEsta tese à centrada no estudo de propriedades estruturais de grafos cujas compressÃes permitem a concepÃÃo de algoritmos eficientes para resolver problemas de otimizaÃÃo. Estamos particularmente interessados em decomposiÃÃes, em jogos de perseguiÃÃo-evasÃo e em convexidade. O jogo de Processo foi definido como um modelo para a reconfiguraÃÃo de roteamento em redes WDM. Muitas vezes, jogos de perseguiÃÃo-evasÃo, em que uma equipe de agentes tem como objetivo limpar um grafo nÃo direcionado, estÃo intimamente relacionados com decomposiÃÃes em grafos. No caso de grafos direcionados, mostramos que o jogo de Processo à monotÃnico e definimos uma nova decomposiÃÃo em grafos equivalente a tal jogo. A partir de entÃo, investigamos outras decomposiÃÃes em grafos. Propomos um algoritmo FPT para calcular vÃrios parÃmetros de largura em grafos. Em particular, este à o primeiro algoritmo FPT para calcular a largura em Ãrvore especial e a largura em Ãrvore q-ramificada de um grafo. Em seguida, estudamos um outro jogo perseguiÃÃo-evasÃo que modela problemas de prÃ-obtenÃÃo. NÃs introduzimos uma versÃo mais realista do jogo de VigilÃncia a versÃo on-line. Estudamos a diferenÃa entre o jogo de VigilÃncia clÃssico e suas versÃes conectadas e on-line, fornecendo novos limites para essa diferenÃa. NÃs, entÃo, definimos um modelo geral para o estudo de jogos perseguiÃÃo-evasÃo, com base em tÃcnicas de programaÃÃo linear. Este mÃtodo permite-nos dar os primeiros resultados de aproximaÃÃo para alguns desses jogos. Finalmente, estudamos outro parÃmetro relacionado com a convexidade e a propagaÃÃo da infecÃÃo em redes, o âhull numberâ. NÃs fornecemos vÃrios resultados de complexidade computacional, dependendo das propriedades estruturais do grafo de entrada e usando decomposiÃÃes em grafos. Alguns destes resultados respondem problemas em aberto na literatura.
This thesis focuses on the study of structural properties of graphs whose understanding enables the design of efficient algorithms for solving optimization problems. We are particularly interested in methods of decomposition, pursuit-evasion games and the notion of convexity. The Process game has been defined as a model for the routing reconfiguration problem in WDM networks. Often, such games where a team of searchers have to clear an undirected graph are closely related to graph decompositions. In digraphs, we show that the Process game is monotone and we define a new equivalent digraph decomposition. Then, we further investigate graph decompositions. We propose a unified FPT-algorithm to compute several graph width parameters. This algorithm turns to be the first FPTalgorithm for the special and the q-branched tree-width of a graph. We then study another pursuit-evasion game which models prefetching problems. We introduce the more realistic online variant of the Surveillance game. We investigate the gap between the classical Surveillance Game and its connected and online versions by providing new bounds. We then define a general framework for studying pursuit-evasion games, based on linear programming techniques. This method allows us to give first approximation results for some of these games. Finally, we study another parameter related to graph convexity and to the spreading of infection in networks, namely the hull number. We provide several complexity results depending on the graph structures making use of graph decompositions. Some of these results answer open questions of the literature.
Thunberg, Johan. "Consensus and Pursuit-Evasion in Nonlinear Multi-Agent Systems". Doctoral thesis, KTH, Optimeringslära och systemteori, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-143658.
Texto completoQC 20140327
Gren, Olaf y Dennis Magnusson. "A Method for Finding Strategies in Pursuit-Evasion Games". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-280341.
Texto completoMånga situationer kan beskrivas som spel på ändliga grafer bestående av en mängd agenter som utför sammansatta handlingar som påverkar spelets till- stånd. En klass sådana spel är de så kallade jaktflyktspelen, där en mängd jägare försöker fånga en flykting på en ändlig spelplan. I vissa jaktflyktspel där flyktingens position är okänd för jägarna kan det vara svårt att hitta en strategi som försäkrar vinst för jägarna. En metod för att förenkla detta är genom att använda sig av multiplayer knowledge-based subset construction (MKBSC) för att expandera spelgrafen till en expanderad graf som innehåller jägarnas kunskap. I denna rapport undersöker vi användbarheten av MKBSC för att hitta kunskapsbaserade strategier för jaktflyktspel genom att analysera de expanderade graferna för hand och extrahera användbar information från dem. Resultatet var att det generellt sett är svårt att hitta användbara kunskapsbaserade strategier för jaktflyktspel genom att för hand analysera den expanderade grafen med en icke-symbolisk representation av spelet. Detta är huvudsakligen på grund av att storleken på det expanderade spelet tenderar att vara mycket stor. Det är möjligt att MKBSC kan vara användbart för att hitta kunskapsbaserade strategier för jaktflyktspel genom att använda en symbolisk representation av spelet eller genom att söka genom den expanderade grafen med hjälp av algoritmer.
Pang, Jing-En. "Pursuit-evasion with acceleration, sensing limitation, and electronic counter measures". Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079487/.
Texto completoJiao, Yue y Ivan Skvortsov. "An optimization approach to the multi-player pursuit-evasion problem". Thesis, KTH, Skolan för teknikvetenskap (SCI), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210825.
Texto completoHermansson, Richard y Eric Peldan. "Pursuit and Evasion in Polygonal Environments - A Mixed Integer Linear Programming Approach". Thesis, KTH, Optimeringslära och systemteori, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105763.
Texto completoDenna rapport introducerar förbättringar till en existerande modell av ett Pursuit-And- Evasion problem. Modellen är formulerad med hjälp av Mixed Integer Linear Programming (MILP). Först testas lösningstiden för originalmodellen utförligt på större och större områden, och med olika antal sökare. Några förbättringar föreslås för att förkorta beräkningstiden, och sedan föreslås även en helt ny modell. Syftet med den nya modellen är att den ska vara mer realistisk, och dessutom så försöker den åtgärda ett problem i originalmodellen som gör att sökare inte får stå för nära varandra.
Grimm, Christopher Lee Jr. "A tensor-train-decomposition-based algorithm for high-dimensional pursuit-evasion games". Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105615.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (pages 99-100).
The research presented in this thesis was inspired by an interest in determining feedback strategies for high-dimensional pursuit-evasion games. When a problem is high-dimensional or involves a state space that is defined by several variables, various methods used to solve pursuit-evasion games often require unrealistic computation time. This problem, called the curse of dimensionality, can be mitigated under certain circumstances by utilizing tensor-train (TT) decomposition. By using this intuition, a new algorithm for solving high dimensional pursuit-evasion problems called Best-Response Tensor-Train-decomposition-based Value Iteration (BR-TT-VI) was developed. BR-TT-VI builds on concepts from game theory, dynamic programming (DP), and tensor-train decomposition. By using TT decomposition, BR-TT-VI greatly reduces the effects of the curse of dimensionality. This work culminates in the application of BR-TT-VI to two different pursuit-evasion problems. First, a four-dimensional problem capable of being solved by traditional value iteration(VI) is tackled by the BR-TT-VI algorithm. This problem allows a direct comparison between VI and BR-TT-VI to demonstrate the reduced computational time of the new algorithm. Finally, BR-TT-VI is used to solve a six-dimensional problem involving two Dubins vehicles that is impractical to solve with VI.
by Christopher Lee Grimm Jr.
S.M.
Phillpot, John. "Line-of-Sight Pursuit and Evasion Games on Polytopes in R^n". Scholarship @ Claremont, 2016. https://scholarship.claremont.edu/hmc_theses/80.
Texto completoLibros sobre el tema "Pursuit-evasion"
Nahin, Paul J. Chases and escapes: The mathematics of pursuit and evasion. Princeton, NJ: Princeton University Press, 2007.
Buscar texto completoHájek, Otomar. Pursuit games: An introduction to the theory and applications of differential games of pursuit and evasion. Mineola, N.Y: Dover Publications, 2008.
Buscar texto completoOffice, General Accounting. Tax administration: Reducing delays in the pursuit of tax revenue on closed criminal cases : report to the Joint Committee on Taxation. Washington, D.C: The Office, 1989.
Buscar texto completo1935-, Yavin Yaakov, Pachter M y Rodin Ervin Y. 1932-, eds. Pursuit-evasion differential games. Oxford, England: Pergamon Press, 1987.
Buscar texto completoPursuit-Evasion Differential Games. Elsevier, 1987. http://dx.doi.org/10.1016/c2009-0-07900-8.
Texto completoNahin, Paul J. Chases and Escapes: The Mathematics of Pursuit and Evasion. Princeton University Press, 2012.
Buscar texto completoChases And Escapes The Mathematics Of Pursuit And Evasion. Princeton University Press, 2012.
Buscar texto completoNahin, Paul J. Chases and Escapes: The Mathematics of Pursuit and Evasion. Princeton University Press, 2007.
Buscar texto completoPursuit Games: An Introduction to the Theory and Applications of Differential Games of Pursuit and Evasion. Dover Publications, 2008.
Buscar texto completoL, Duke Eugene y United States. National Aeronautics and Space Administration., eds. Time-optimal aircraft pursuit-evasion with a weapon envelope constraint: Final report. Atlanta, GA: Georgia Institute of Technology, School of Aerospace Engineering, 1990.
Buscar texto completoCapítulos de libros sobre el tema "Pursuit-evasion"
Patsko, Valerii, Sergey Kumkov y Varvara Turova. "Pursuit-Evasion Games". En Handbook of Dynamic Game Theory, 1–87. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-27335-8_30-1.
Texto completoPatsko, Valerii, Sergey Kumkov y Varvara Turova. "Pursuit-Evasion Games". En Handbook of Dynamic Game Theory, 1–87. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-27335-8_30-2.
Texto completoPatsko, Valerii, Sergey Kumkov y Varvara Turova. "Pursuit-Evasion Games". En Handbook of Dynamic Game Theory, 951–1038. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-44374-4_30.
Texto completoRamachandran, Kandethody M. y Chris P. Tsokos. "Stochastic Linear Pursuit-Evasion Game". En Stochastic Differential Games. Theory and Applications, 25–45. Paris: Atlantis Press, 2012. http://dx.doi.org/10.2991/978-94-91216-47-3_2.
Texto completoKlein, Kyle y Subhash Suri. "Pursuit Evasion on Polyhedral Surfaces". En Algorithms and Computation, 284–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45030-3_27.
Texto completoAdler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler y Berthold Vöcking. "Randomized Pursuit-Evasion in Graphs". En Automata, Languages and Programming, 901–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45465-9_77.
Texto completoFriedman, Avner. "A mini-max pursuit evasion algorithm". En Mathematics in Industrial Problems, 72–83. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4757-4129-2_7.
Texto completoKlein, Kyle y Subhash Suri. "Multiagent Pursuit Evasion, or Playing Kabaddi". En Springer Tracts in Advanced Robotics, 89–104. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17452-0_6.
Texto completoPachter, Meir. "Isaacs’ Two-on-One Pursuit-Evasion Game". En Annals of the International Society of Dynamic Games, 25–55. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56534-3_2.
Texto completoAl-Bluwi, Ibrahim y Ashraf Elnagar. "Pursuit Evasion in Dynamic Environments with Visibility Constraints". En Intelligent Robotics and Applications, 116–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16587-0_12.
Texto completoActas de conferencias sobre el tema "Pursuit-evasion"
Spirakis, P. y B. Tampakas. "Distributed pursuit-evasion". En the thirteenth annual ACM symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/197917.198191.
Texto completoMERZ, A. "Noisy satellite pursuit-evasion". En Guidance, Navigation and Control Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1987. http://dx.doi.org/10.2514/6.1987-2319.
Texto completoRobin, Cyril y Simon Lacroix. "Failure anticipation in pursuit-evasion". En Robotics: Science and Systems 2012. Robotics: Science and Systems Foundation, 2012. http://dx.doi.org/10.15607/rss.2012.viii.046.
Texto completoStiffler, Nicholas M. y Jason M. O'Kane. "Pursuit-evasion with fixed beams". En 2016 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2016. http://dx.doi.org/10.1109/icra.2016.7487621.
Texto completoM. Vieira, Marcos A., Ramesh Govindan y Gaurav S.Sukhatme. "Scalable and Practical Pursuit-Evasion". En 2nd International ICST Conference on Robot Communication and Coordination. IEEE, 2009. http://dx.doi.org/10.4108/icst.robocomm2009.5838.
Texto completoGuan, Yue, Dipankar Maity, Christopher M. Kroninger y Panagiotis Tsiotras. "Bounded-Rational Pursuit-Evasion Games". En 2021 American Control Conference (ACC). IEEE, 2021. http://dx.doi.org/10.23919/acc50511.2021.9483152.
Texto completoZhu, Jiagang, Wei Zou y Zheng Zhu. "Learning Evasion Strategy in Pursuit-Evasion by Deep Q-network". En 2018 24th International Conference on Pattern Recognition (ICPR). IEEE, 2018. http://dx.doi.org/10.1109/icpr.2018.8546182.
Texto completoSunkara, Vishwamithra, Animesh Chakravarthy y Debasish Ghose. "Pursuit Evasion Games using Collision Cones". En 2018 AIAA Guidance, Navigation, and Control Conference. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2018. http://dx.doi.org/10.2514/6.2018-2108.
Texto completoWalrand, Jean, Elijah Polak y Hoam Chung. "Harbor attack: A pursuit-evasion game". En 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2011. http://dx.doi.org/10.1109/allerton.2011.6120357.
Texto completoCheung, Warren y William Evans. "Pursuit-Evasion Voronoi Diagrams in \ell_1". En 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007). IEEE, 2007. http://dx.doi.org/10.1109/isvd.2007.33.
Texto completoInformes sobre el tema "Pursuit-evasion"
Rodin, Ervin Y. Artificial Intelligence Methods in Pursuit Evasion Differential Games. Fort Belvoir, VA: Defense Technical Information Center, julio de 1990. http://dx.doi.org/10.21236/ada227366.
Texto completoBopardikar, Shaunak D., Francesco Bullo y Joao P. Hespanha. On Discrete-Time Pursuit-Evasion Games with Sensing Limitations. Fort Belvoir, VA: Defense Technical Information Center, enero de 2008. http://dx.doi.org/10.21236/ada480943.
Texto completo