Log in

Relevant bibliographies by topics / Pursuit-evasion / Journal articles

Journal articles on the topic 'Pursuit-evasion'

To see the other types of publications on this topic, follow the link: Pursuit-evasion.

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Pursuit-evasion.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Scott, Allan, and Ulrike Stege. "Parameterized pursuit-evasion games." Theoretical Computer Science 411, no. 43 (October 2010): 3845–58. http://dx.doi.org/10.1016/j.tcs.2010.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Feng, Yanghe, Lanruo Dai, Jinwu Gao, and Guangquan Cheng. "Uncertain pursuit-evasion game." Soft Computing 24, no. 4 (December 12, 2018): 2425–29. http://dx.doi.org/10.1007/s00500-018-03689-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

ADLER, MICAH, HARALD RCKE, NAVEEN SIVADASAN, CHRISTIAN SOHLER, and BERTHOLD VCKING. "Randomized Pursuit-Evasion in Graphs." Combinatorics, Probability and Computing 12, no. 3 (May 2003): 225–44. http://dx.doi.org/10.1017/s0963548303005625.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lehner, Florian. "Pursuit evasion on infinite graphs." Theoretical Computer Science 655 (December 2016): 30–40. http://dx.doi.org/10.1016/j.tcs.2016.04.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Merz, A. W. "Noisy satellite pursuit-evasion guidance." Journal of Guidance, Control, and Dynamics 12, no. 6 (November 1989): 901–5. http://dx.doi.org/10.2514/3.20498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chung, F. R. K., Joel E. Cohen, and R. L. Graham. "Pursuit—Evasion games on graphs." Journal of Graph Theory 12, no. 2 (1988): 159–67. http://dx.doi.org/10.1002/jgt.3190120205.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gutman, S., M. Esh, and M. Gefen. "Simple linear pursuit-evasion games." Computers & Mathematics with Applications 13, no. 1-3 (1987): 83–95. http://dx.doi.org/10.1016/0898-1221(87)90095-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mycielski, J. "Theories of pursuit and evasion." Journal of Optimization Theory and Applications 56, no. 2 (February 1988): 271–84. http://dx.doi.org/10.1007/bf00939412.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mycielski, J. "Theories of pursuit and evasion." Journal of Optimization Theory and Applications 61, no. 1 (April 1989): 147. http://dx.doi.org/10.1007/bf00940851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Klein, Kyle, and Subhash Suri. "Pursuit Evasion on Polyhedral Surfaces." Algorithmica 73, no. 4 (April 29, 2015): 730–47. http://dx.doi.org/10.1007/s00453-015-9988-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Rubinsky, Sergey, and Shaul Gutman. "Three-Player Pursuit and Evasion Conflict." Journal of Guidance, Control, and Dynamics 37, no. 1 (January 2014): 98–110. http://dx.doi.org/10.2514/1.61832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Shah, Kunal, and Mac Schwager. "GRAPE: Geometric Risk-Aware Pursuit-Evasion." Robotics and Autonomous Systems 121 (November 2019): 103246. http://dx.doi.org/10.1016/j.robot.2019.07.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

O’Connell, James. "Pursuit and evasion strategies in football." Physics Teacher 33, no. 8 (November 1995): 516–18. http://dx.doi.org/10.1119/1.2344282.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Abiola, Bankole, and R. K. Ojikutu. "Pursuit and Evasion Game under Uncertainty." American Journal of Applied Mathematics and Statistics 1, no. 2 (April 30, 2013): 21–26. http://dx.doi.org/10.12691/ajams-1-2-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Morgan, John A. "Interception in differential pursuit/evasion games." Journal of Dynamics and Games 3, no. 4 (October 2016): 335–54. http://dx.doi.org/10.3934/jdg.2016018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Isler, Volkan, Sampath Kannan, and Sanjeev Khanna. "Randomized Pursuit-Evasion with Local Visibility." SIAM Journal on Discrete Mathematics 20, no. 1 (January 2006): 26–41. http://dx.doi.org/10.1137/s0895480104442169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Rodin, E. Y. "A pursuit-evasion bibliography—Version 1." Computers & Mathematics with Applications 13, no. 1-3 (1987): 275–340. http://dx.doi.org/10.1016/0898-1221(87)90110-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Rodin, E. Y. "A Pursuit-evasion bibliography—Version 2." Computers & Mathematics with Applications 18, no. 1-3 (1989): 245–320. http://dx.doi.org/10.1016/0898-1221(89)90139-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Krivoi, S. F., A. P. Krikovlyuk, I. G. Moroz-Podvorchan, F. I. Mushka, and E. M. Pik. "A problem of pursuit and evasion." Cybernetics and Systems Analysis 28, no. 3 (1992): 445–50. http://dx.doi.org/10.1007/bf01125425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Dawes, Robin W. "Some pursuit-evasion problems on grids." Information Processing Letters 43, no. 5 (October 1992): 241–47. http://dx.doi.org/10.1016/0020-0190(92)90218-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Bernhard, Pierre, and Odile Pourtallier. "Pursuit evasion game with costly information." Dynamics and Control 4, no. 4 (October 1994): 365–82. http://dx.doi.org/10.1007/bf01974141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Atir, H. "Double threat in pursuit-evasion games." Dynamics and Control 4, no. 4 (October 1994): 349–63. http://dx.doi.org/10.1007/bf01974140.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

GUIBAS, LEONIDAS J., JEAN-CLAUDE LATOMBE, STEVEN M. LAVALLE, DAVID LIN, and RAJEEV MOTWANI. "A VISIBILITY-BASED PURSUIT-EVASION PROBLEM." International Journal of Computational Geometry & Applications 09, no. 04n05 (August 1999): 471–93. http://dx.doi.org/10.1142/s0218195999000273.

Full text

Abstract:

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simply-connected free spaces, it is shown that the minimum number of pursuers required is Θ( lg n). For multiply-connected free spaces, the bound is [Formula: see text] pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a finite graph that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.

APA, Harvard, Vancouver, ISO, and other styles

24

Kuchkarov, Atamurat, Gafurjan Ibragimov, and Massimiliano Ferrara. "Simple Motion Pursuit and Evasion Differential Games with Many Pursuers on Manifolds with Euclidean Metric." Discrete Dynamics in Nature and Society 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1386242.

Full text

Abstract:

We consider pursuit and evasion differential games of a group ofmpursuers and one evader on manifolds with Euclidean metric. The motions of all players are simple, and maximal speeds of all players are equal. If the state of a pursuer coincides with that of the evader at some time, we say that pursuit is completed. We establish that each of the differential games (pursuit or evasion) is equivalent to a differential game ofmgroups of countably many pursuers and one group of countably many evaders in Euclidean space. All the players in any of these groups are controlled by one controlled parameter. We find a condition under which pursuit can be completed, and if this condition is not satisfied, then evasion is possible. We construct strategies for the pursuers in pursuit game which ensure completion the game for a finite time and give a formula for this time. In the case of evasion game, we construct a strategy for the evader.

APA, Harvard, Vancouver, ISO, and other styles

25

Hafer, William T., Helen L. Reed, James D. Turner, and Khanh Pham. "Sensitivity Methods Applied to Orbital Pursuit Evasion." Journal of Guidance, Control, and Dynamics 38, no. 6 (June 2015): 1118–26. http://dx.doi.org/10.2514/1.g000832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Beveridge, Andrew, and Yiqing Cai. "Pursuit-evasion in a two-dimensional domain." Ars Mathematica Contemporanea 13, no. 1 (March 3, 2017): 187–206. http://dx.doi.org/10.26493/1855-3974.1060.031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Isler, V., S. Kannan, and S. Khanna. "Randomized pursuit-evasion in a polygonal environment." IEEE Transactions on Robotics 21, no. 5 (October 2005): 875–84. http://dx.doi.org/10.1109/tro.2005.851373.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kolling, A., and S. Carpin. "Pursuit-Evasion on Trees by Robot Teams." IEEE Transactions on Robotics 26, no. 1 (February 2010): 32–47. http://dx.doi.org/10.1109/tro.2009.2035737.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Dumitrescu, Adrian, Howi Kok, Ichiro Suzuki, and PaweŁ Żyliński. "Vision-Based Pursuit-Evasion in a Grid." SIAM Journal on Discrete Mathematics 24, no. 3 (January 2010): 1177–204. http://dx.doi.org/10.1137/070700991.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Li, Dongxu, Jose B. Cruz, and Corey J. Schumacher. "Stochastic multi-player pursuit–evasion differential games." International Journal of Robust and Nonlinear Control 18, no. 2 (2007): 218–47. http://dx.doi.org/10.1002/rnc.1193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ghrist, Robert, and Sanjeevi Krishnan. "Positive Alexander Duality for Pursuit and Evasion." SIAM Journal on Applied Algebra and Geometry 1, no. 1 (January 2017): 308–27. http://dx.doi.org/10.1137/16m1089083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Berkovitz, Leonard D. "Differential Games of Generalized Pursuit and Evasion." SIAM Journal on Control and Optimization 24, no. 3 (May 1986): 361–73. http://dx.doi.org/10.1137/0324021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tovar, Benjamín, and Steven M. LaValle. "Visibility-based Pursuit—Evasion with Bounded Speed." International Journal of Robotics Research 27, no. 11-12 (November 2008): 1350–60. http://dx.doi.org/10.1177/0278364908097580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Stiffler, Nicholas M., and Jason M. O’Kane. "Complete and optimal visibility-based pursuit-evasion." International Journal of Robotics Research 36, no. 8 (July 2017): 923–46. http://dx.doi.org/10.1177/0278364917711535.

Full text

Abstract:

This paper computes a minimum-length pursuer trajectory that solves a visibility-based pursuit-evasion problem in which a single pursuer moving through a simply-connected polygonal environment seeks to locate an evader which may move arbitrarily fast, using an omni-directional field-of-view that extends to the environment boundary. We present a complete algorithm that computes a minimum-cost pursuer trajectory that ensures that the evader is captured, or reports in finite time that no such trajectory exists. This result improves upon the known algorithm of Guibas, Latombe, LaValle, Lin, and Motwani, which is complete but makes no guarantees about the quality of the solution. Our algorithm employs a branch-and-bound forward search that considers pursuer trajectories that could potentially lead to an optimal pursuer strategy. The search is performed on an exponential graph that can generate an infinite number of unique pursuer trajectories, so we must conduct meticulous pruning during the search to quickly discard pursuer trajectories that are demonstrably suboptimal. We describe an implementation of the algorithm, along with experiments that measure its performance in several environments with a variety of pruning operations.

APA, Harvard, Vancouver, ISO, and other styles

35

Turetsky, Vladimir, and Tal Shima. "Pursuit-Evasion Guidance in a Switched System." SIAM Journal on Control and Optimization 56, no. 4 (January 2018): 2613–33. http://dx.doi.org/10.1137/17m1142764.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Bonato, Anthony, Paweł Prałat, and Changping Wang. "Pursuit-Evasion in Models of Complex Networks." Internet Mathematics 4, no. 4 (January 2007): 419–36. http://dx.doi.org/10.1080/15427951.2007.10129149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Prasad, U. R., and N. Rajan. "Aircraft pursuit-evasion problems with variable speeds." Computers & Mathematics with Applications 13, no. 1-3 (1987): 111–21. http://dx.doi.org/10.1016/0898-1221(87)90097-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Merz, A. W. "Stochastic guidance laws in satellite pursuit-evasion." Computers & Mathematics with Applications 13, no. 1-3 (1987): 151–56. http://dx.doi.org/10.1016/0898-1221(87)90100-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Järmark, B. "On closed-loop controls in pursuit-evasion." Computers & Mathematics with Applications 13, no. 1-3 (1987): 157–66. http://dx.doi.org/10.1016/0898-1221(87)90101-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Yavin, Y., and R. De Villiers. "Stochastic pursuit-evasion differential games in 3D." Journal of Optimization Theory and Applications 56, no. 3 (March 1988): 345–57. http://dx.doi.org/10.1007/bf00939548.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Ramana, M. V., and Mangal Kothari. "Pursuit-Evasion Games of High Speed Evader." Journal of Intelligent & Robotic Systems 85, no. 2 (July 14, 2016): 293–306. http://dx.doi.org/10.1007/s10846-016-0379-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kwak, Dong Jun, and H. Jin Kim. "Policy Improvements for Probabilistic Pursuit-Evasion Game." Journal of Intelligent & Robotic Systems 74, no. 3-4 (July 11, 2013): 709–24. http://dx.doi.org/10.1007/s10846-013-9857-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Chung, Timothy H., Geoffrey A. Hollinger, and Volkan Isler. "Search and pursuit-evasion in mobile robotics." Autonomous Robots 31, no. 4 (July 20, 2011): 299–316. http://dx.doi.org/10.1007/s10514-011-9241-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Klein, Kyle, and Subhash Suri. "Capture bounds for visibility-based pursuit evasion." Computational Geometry 48, no. 3 (March 2015): 205–20. http://dx.doi.org/10.1016/j.comgeo.2014.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Neufeld, Stewart W. "A pursuit-evasion problem on a grid." Information Processing Letters 58, no. 1 (April 1996): 5–9. http://dx.doi.org/10.1016/0020-0190(96)00025-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Kopparty, Swastik, and Chinya V. Ravishankar. "A framework for pursuit evasion games in." Information Processing Letters 96, no. 3 (November 2005): 114–22. http://dx.doi.org/10.1016/j.ipl.2005.04.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Szőts, János, Andrey V. Savkin, and István Harmati. "Revisiting a Three-Player Pursuit-Evasion Game." Journal of Optimization Theory and Applications 190, no. 2 (July 5, 2021): 581–601. http://dx.doi.org/10.1007/s10957-021-01899-8.

Full text

Abstract:

AbstractWe consider the game of a holonomic evader passing between two holonomic pursuers. The optimal trajectories of this game are known. We give a detailed explanation of the game of kind’s solution and present a computationally efficient way to obtain trajectories numerically by integrating the retrograde path equations. Additionally, we propose a method for calculating the partial derivatives of the Value function in the game of degree. This latter result applies to differential games with homogeneous Value.

APA, Harvard, Vancouver, ISO, and other styles

48

Kung, Chien-Chun, and Kuei-Yi Chen. "MISSILE GUIDANCE ALGORITHM DESIGN USING PARTICLE SWARM OPTIMIZATION." Transactions of the Canadian Society for Mechanical Engineering 37, no. 3 (September 2013): 971–79. http://dx.doi.org/10.1139/tcsme-2013-0083.

Full text

Abstract:

This paper presents a PSO guidance (PSOG) algorithm design for the pursuit-evasion optimization problem. The initialized particles are randomly set within the guidance command solution space and the relative distance is taken as the objective function. As the PSOG algorithm proceeds, the iteration will execute until the global optimum is reached. Two pursuit-evasion scenarios show that the PSOG algorithm has satisfied performance in execution time, terminal miss distance, time of interception, final stage turning rate and robust pursuit capability.

APA, Harvard, Vancouver, ISO, and other styles

49

Ibragimov, Gafurjan, and Shravan Luckraz. "On a Characterization of Evasion Strategies for Pursuit-Evasion Games on Graphs." Journal of Optimization Theory and Applications 175, no. 2 (August 17, 2017): 590–96. http://dx.doi.org/10.1007/s10957-017-1155-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

de Villiers, R., C. J. Wright, and Y. Yavin. "A stochastic pursuit-evasion differential game in 3-D: Optimal evasion strategies." Computers & Mathematics with Applications 13, no. 7 (1987): 623–30. http://dx.doi.org/10.1016/0898-1221(87)90124-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!