Curvature line parametrized surfaces and orthogonal coordinate systems. Discretization with Dupin cyclides

Cyclidic nets are introduced as discrete analogs of curvature line parametrized surfaces and orthogonal coordinate systems. A 2-dimensional cyclidic net is a piecewise smooth $C^1$-surface built from surface patches of Dupin cyclides, each patch being bounded by curvature lines of the supporting cyclide. An explicit description of cyclidic nets is given and their relation to the established discretizations of curvature line parametrized surfaces as circular, conical and principal contact element nets is explained. We introduce 3-dimensional cyclidic nets as discrete analogs of triply-orthogonal coordinate systems and investigate them in detail. Our considerations are based on the Lie geometric description of Dupin cyclides. Explicit formulas are derived and implemented in a computer program.Comment: 39 pages, 30 figures; Theorem 2.7 has been reformulated, as a normalization factor in formula (2.4) was missing. The corresponding formulations have been adjusted and a few typos have been correcte

Dynamic distributed lanes: motion planning for multiple autonomous vehicles

Unorganized traffic is a generalized form of travel wherein vehicles do not adhere to any predefined lanes and can travel in-between lanes. Such travel is visible in a number of countries e.g. India, wherein it enables a higher traffic bandwidth, more overtaking and more efficient travel. These advantages are visible when the vehicles vary considerably in size and speed, in the absence of which the predefined lanes are near-optimal. Motion planning for multiple autonomous vehicles in unorganized traffic deals with deciding on the manner in which every vehicle travels, ensuring no collision either with each other or with static obstacles. In this paper the notion of predefined lanes is generalized to model unorganized travel for the purpose of planning vehicles travel. A uniform cost search is used for finding the optimal motion strategy of a vehicle, amidst the known travel plans of the other vehicles. The aim is to maximize the separation between the vehicles and static obstacles. The search is responsible for defining an optimal lane distribution among vehicles in the planning scenario. Clothoid curves are used for maintaining a lane or changing lanes. Experiments are performed by simulation over a set of challenging scenarios with a complex grid of obstacles. Additionally behaviours of overtaking, waiting for a vehicle to cross and following another vehicle are exhibited