Zaloguj się

Gotowe bibliografie tematyczne / Pursuit-evasion / Artykuły w czasopismach

Artykuły w czasopismach na temat „Pursuit-evasion”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Pursuit-evasion.

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 1 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Pursuit-evasion”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

13

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

24

Kuchkarov, Atamurat, Gafurjan Ibragimov i 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.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

25

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

35

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

48

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

49

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!