Most algorithms in probabilistic sampling-based path planning compute collision-free paths made of straight line segments lying in the configuration space. Due to the randomness of sampling, the paths make detours that need to be optimized. The contribution of this paper is to propose a basic gradient-based (GB) algorithm that transforms a polygonal collision-free path into a shorter one. While...

To improve the accuracy of image classification, a kind improved model is proposed. The shortcut added to GoogLeNet inception v1 and several other ways are given, they GRSN1_2, GRSN1_3, GRSN1_4. Among them, information input layer directly output each subsequent in form shortcut. new has advantages multi-size small convolution kernel same network reduce loss. Meanwhile, as number blocks increas...

We consider the problem of finding a shortcut connecting two vertices of a graph that minimizes the diameter of the resulting graph. We present an O(n2 log3 n)-time algorithm using linear space for the case that the input graph is a tree consisting of n vertices. Additionally, we present an O(n2 log3 n)-time algorithm using linear space for a continuous version of this problem. 1998 ACM Subject...

Hemodialysis arteriovenous fistula is a shortcut of the systemic circulation and sometimes flow exceeds 2 L/min. Possible hemodynamic clinical consequences are discussed.