Results 121 to 130 of about 59,758 (255)

Edge-Transitive Lexicographic and Cartesian Products

open access: yesDiscussiones Mathematicae Graph Theory, 2016
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried   +3 more
doaj   +1 more source

CONCERT: A Modular Reconfigurable Robot for Construction

open access: yesJournal of Field Robotics, EarlyView.
ABSTRACT This paper presents CONCERT, a fully reconfigurable modular collaborative robot (cobot) for multiple on‐site operations in a construction site. CONCERT has been designed to support human activities in construction sites by leveraging two main characteristics: high‐power density motors and modularity. In this way, the robot is able to perform a
Luca Rossini   +18 more
wiley   +1 more source

Motion planning in cartesian product graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
Let G be an undirected graph with n vertices. Assume that a robot is placed on a vertex and n − 2 obstacles are placed on the other vertices. A vertex on which neither a robot nor an obstacle is placed is said to have a hole.
Deb Biswajit, Kapoor Kalpesh
doaj   +1 more source

Vector Field‐Based Collision‐Free Navigation in Tunnel‐Like Environments

open access: yesJournal of Field Robotics, EarlyView.
ABSTRACT Tunnel‐like environments, renowned for their vast scale, confined spaces, and limited visibility, present significant challenges for autonomous robot navigation. This study addresses the critical issue of guiding robots through such environments while ensuring collision‐free navigation and maintaining a specified safety margin from both tunnel
Bao Jianjun   +5 more
wiley   +1 more source

Key Technical Fields and Future Outlooks of Space Manipulators: A Survey

open access: yesSmartBot, EarlyView.
This paper systematically reviews the technological development of space manipulators, emphasizing the unique challenges posed by space environments. It examines four areas: structural design, modeling, planning, and control, while introducing typical ground test platforms.
Gang Chen   +12 more
wiley   +1 more source

Formal Approach to Safety‐Driven Dynamic Procedure Modeling

open access: yesSystems Engineering, EarlyView.
ABSTRACT Ensuring the safety of unmanned aerial systems (UAS) is a growing concern as the number of UAS grows increasingly fast. Regulatory bodies are in the process of tackling this problem by issuing standards and recommendations to be met by UAS designers.
Jean‐Charles Chaudemar   +3 more
wiley   +1 more source

A note on a Vizing's generalized conjecture [PDF]

open access: yesOpuscula Mathematica, 2007
In this note we give a generalized version of Vizing's conjecture concerning the distance domination number for the cartesian product of two graphs.
Mostafa Blidia, Mustapha Chellali
doaj  

Hamiltonicity of Cartesian products of graphs

open access: yes
A path factor in a graph $G$ is a factor of $G$ in which every component is a path on at least two vertices. Let $T\Box P_n$ be the Cartesian product of a tree $T$ and a path on $n$ vertices. Kao and Weng proved that $T\Box P_n$ is hamiltonian if $T$ has a path factor, $n$ is an even integer and $n\geq 4Δ(T)-2$. They conjectured that for every $Δ\geq 3$
Ladinek, Irena Hrastnik   +3 more
openaire   +2 more sources

The First Archaeomagnetic Age at Tiwanaku and Implications for Dating Andean Metallurgical Furnaces

open access: yesArchaeometry, EarlyView.
ABSTRACT This paper presents the first archaeomagnetic dating at Tiwanaku (Andean Altiplano). We compared the geomagnetic field values recorded by a metallurgical furnace against an updated SHAWQ2k‐SH global model and a regional intensity curve, both of which include, for the first time, high‐quality intensity data from the Southern Hemisphere. Results
Judit del Río   +6 more
wiley   +1 more source

Cuts in Cartesian Products of Graphs

open access: yes, 2011
The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a k-dimensional hypercube.
Sachdeva, Sushant, Tulsiani, Madhur
openaire   +2 more sources

Home - About - Disclaimer - Privacy