Polat Charyyev
Biographic Data
| ID | 9966534 |
|---|---|
| NAME | Polat Charyyev |
| GIVEN NAMES | Polat |
| FAMILY NAME | Charyyev |
| SIGNATURE | CHARYYEV P |
| AFFILIATIONS | Naval Academy |
| ORCID | 0009-0002-3862-3214 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2025 |
| LATEST PUBLICATION YEAR | 2025 |
| H-INDEX | 0 |
Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (re…
No prominent works on this page.
Adversarial Obstacle Placement with Spatial Point Processes for Optimal Path Disruption
We investigate the Optimal Obstacle Placement (OOP) problem under uncertainty, framed as the dual of the Optimal Traversal Path problem in the Stochastic Obstacle Scene paradigm. We consider both continuous domains, discretized for analysis, and already discrete spatial grids that form weighted geospatial networks using 8-adjacency lattices. Our unified framework integrates OOP with stochastic geometry, modeling obstacle placement via Strauss (re…
Distributed Control Multi-Agent Systems (1 work) · Monte Carlo method (1 work) · Obstacle (1 work) · Optimization and Search Problems (1 work) · Reachability (1 work) · Robotic Path Planning Algorithms (1 work) · Tree traversal (1 work)