Results 331 to 340 of about 130,220 (362)

Edge Intersection Graphs of Paths on a Grid

2019
We investigate the class of vertex intersection graphs of paths on a grid, and specifically consider the subclasses that are obtained when each path in the representation has at most k bends (turns). We call such a subclass the Bk-VPG graphs, kC 0.
Martin Charles Golumbic, Gila Morgenstern   +1 more
openaire   +1 more source

Path planning on grid maps with unknown goal poses

16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013), 2013
Path planning for robots typically consists of finding a path from a given start state to one or multiple given goal states. However, there are situations in which the pose of the goal state is not explicitly known, e.g. in sensor-based autonomous driving in unknown environments.
Georg Tanzmeister, Martin Friedl, Dirk Wollherr, Martin Buss   +3 more
openaire   +1 more source

Path planning using hybrid grid representation on rough terrain

Industrial Robot: An International Journal, 2009
PurposePath planning approaches based on conventional occupancy grid maps are problematic in off‐road environment because impossible areas include not only obstacles but also landscapes like ramps and pits. The purpose of this paper is to develop a path planning method in a hybrid grid map, which aims to provide a better solution for outdoor navigation.
Jiajun Gu, Qixin Cao
openaire   +1 more source

On Breach Path Detection Reliability of Wireless Sensor Grids

2012 21st International Conference on Computer Communications and Networks (ICCCN), 2012
We consider wireless sensor networks (WSNs) deployed in the plane for area surveillance against intrusion attacks. Sensor nodes often employ low-cost sensing and wireless communication modules that are prone to random failure especially when operated in harsh environments.
M. H. Shazly, E. S. Elmallah, J. Harms
openaire   +1 more source

Counting paths on a grid

2008
Refereed/Peer ...
openaire   +1 more source

Control-path Oriented Workflow Intelligence Analysis on EnterprizeWorkflow Grids

2005 First International Conference on Semantics, Knowledge and Grid, 2005
This paper1 proposes a workflow intelligence and quality improvement framework maximizing the workflow trace- ability and rediscoverability by analyzing the total sequences of the control-path perspective of a workflow model and by rediscovering their runtime enactment history from the workflow log information.
openaire   +1 more source

Encoding Shortest Paths in Triangular Grids for Delivery Without Errors

International Conference on Future Networks and Distributed Systems, 2017
Gokce Caylak Kayaturan, A. Vernitski
semanticscholar   +1 more source

Approximating Domination on Intersection Graphs of Paths on a Grid

2018
A graph G is called \({B}_k\)-EPG (resp., \({B}_k\)-VPG), for some constant \(k\ge 0\), if it has a string representation on an axis-parallel grid such that each vertex is a path with at most k bends and two vertices are adjacent in G if and only if the corresponding strings share at least one grid edge (resp., the corresponding strings intersect each ...
openaire   +1 more source

Antibiotic resistance in the patient with cancer: Escalating challenges and paths forward

Ca-A Cancer Journal for Clinicians, 2021
Amila K Nanayakkara, Kevin Outterson
exaly  

Edge-Intersection Graphs of k-Bend Paths in Grids

International Computing and Combinatorics Conference, 2009
Therese Biedl, Michal Stern
semanticscholar   +1 more source