Results 21 to 30 of about 5,659 (189)
Line-of-Sight Pursuit in Monotone and Scallop Polygons [PDF]
International Journal of Computational Geometry & Applications, 2019 We study a turn-based game in a simply connected polygonal environment [Formula: see text] between a pursuer [Formula: see text] and an adversarial evader [Formula: see text]. Both players can move in a straight line to any point within unit distance during their turn.
Lindsay Berry +6 more
openaire +2 more sources
Coverage path planning considering the cell number and starting position
Xi'an Gongcheng Daxue xuebaoThe coverage tasks of mobile robots are evolving towards large-scale and intelligent directions, demanding urgent requirements for the coverage efficiency and environmental adaptability of coverage path planning. To address the inadequate adaptability of
MA Mingyan +4 more
doaj +1 more source
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility [PDF]
, 2020 We present an $O(nrG)$ time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction $θ$, while $θ$ varies in $[0,180^{\circ})$, obtaining the directions for the tour to be the shortest one over all tours, where $n$ is the number of vertices, $r$ is the number of ...
Bengt J. Nilsson +4 more
openaire +3 more sources
Adaptive Path Planning for Depth Constrained Bathymetric Mapping with an Autonomous Surface Vessel
, 2016 This paper describes the design, implementation and testing of a suite of algorithms to enable depth constrained autonomous bathymetric (underwater topography) mapping by an Autonomous Surface Vessel (ASV).
Cover TM +11 more
core +1 more source
Modem illumination of monotone polygons
, 2009 We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone orthogonal polygons.
Aichholzer, Oswin +6 more
openaire +2 more sources
On the Complexity of Half-Guarding Monotone Polygons
, 2022 15 pages, 19 figures, preliminary version appeared in EuroCG ...
Hillberg, Hannah Miller +2 more
openaire +3 more sources
A strongly monotonic polygonal Euler scheme
Journal of ComplexityIn recent years tamed schemes have become an important technique for simulating SDEs and SPDEs whose continuous coefficients display superlinear growth. The taming method, which involves curbing the growth of the coefficients as a function of stepsize, has so far however not been adapted to preserve the monotonicity of the coefficients. This has arisen
Johnston, Tim, Sabanis, Sotirios
openaire +2 more sources
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
, 2017 Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation.
A Pilz +19 more
core +1 more source
Multi‐Material Additive Manufacturing of Soft Robotic Systems: A Comprehensive Review
Advanced Robotics Research, EarlyView.This review explores the transformative role of multi‐material additive manufacturing (MMAM) in the development of soft robotic systems. It presents current techniques, materials, and design strategies that enable functionally graded and adaptive structures.
Ritik Raj +2 more
wiley +1 more source
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
Advanced Robotics Research, EarlyView.A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source