Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and a path. The resistance distance between any two vertices of a wheel and a fan are obtained. The resistances are related to Fibonacci numbers and generalized Fibonacci numbers. The derivation is based on evaluating determinants of submatrices of the Laplacian matrix. A com...

This paper investigates the path tracking problem for an electric vehicle which has four electromechanical wheel systems under normal and faulty conditions. With considering wheel slip constraints and certain actuator faults, a passive fault-tolerant controller based on variable structure control is developed to maintain the system stability and guarantee the acceptable tracking performance. Th...

Abstract: A four-wheeled autonomic trolley of obstacle avoidance is controlled by way of front-wheel steering and backwheel driving. Three pairs of ultrasonic sensors are, respectively, installed on the left front, front and right front of the trolley in order to measure the distances between obstacles and the trolley. Its control strategy is derived from the concept of path planning for mobile...

Three single-valued upper boundary functions for velocity, acceleration and deceleration of a wheeled mobile robot (WMR) are defined as closed mathematical forms over its entire spatial path. The limits deal with mechanical, kinematic and dynamic characteristics of the robot and with task and operating matters. These boundary functions can be computed making use of any robot model, as complex a...

In this study, to improve the accuracy of path tracking in intelligent vehicles, we propose an vehicle path-tracking control method based on improved model predictive (MPC) combined with hybrid proportional-integral-derivative (PID) theory. lateral control, a constraint side deflection front wheel is added traditional MPC and relaxation factor introduced stability for driving stability. longitu...

Aimed at the difficulty of path planning resulting from variable configuration wheel-legged robot for future deep space explorations, this paper proposes a algorithm based on Theta* and Timed Elastic Band (TEB) algorithm. Firstly, structure is briefly introduced, workspace single leg analyzed. Secondly, method to judge complete obstacles incomplete according height proposed alongside search vir...

This paper deals with the simulation of oo-road robots while taking into account the mechanical behavior of the locomotion system and its interaction with its environment. This interaction is studied and discussed for diierent behaviors of wheel-soil contact. The analysis considers phenomena of slips, of soil shear deformations, of soil compaction and wheel elastic deformation. Wheel-soil conta...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides ...