In this paper, we present a novel solution for a path following problem in partially-known static environments. Given linearized error dynamic equations, model predictive control (MPC) is employed to produce a sequence of angular velocities. Since the forward velocity of the robot has to be adapted to environmental constraints and robot dynamics while the robot is following a path, we propose a...

This paper describes a system which can model an assembly task performed by a human. The actions are recorded in real-time using a stereo system. The assembled objects ana' the jingers of the hand are tracked through the image sequence. We use the spatial relations between the fingers and the objects to temporally segment the task into approach, pre-manipulate, manipulate and depart phases. We ...

In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...

A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in compressed format. On the other hand, control flow traces are frequently queried to assist program analysis and optimization, e.g. finding frequently executed subpaths that may be optimized. In this paper, we identify path...

This paper investigates the nesting issue and the machining path planning issue for improving the sheet metal machining efficiency. The nesting issue is to maximise sheet metal material utilisation ratio by nesting parts of various shapes into the sheet. The path planning issue is to optimise machining sequence so that the total machining path distance and machining time are minimised. This wor...

Definition 1. Given a undirected graph G = (V,E), two vertices are adjacent when they are both incident to a common edge. A path in an undirected graph is a sequence of vertices P = (v1, v2, . . . , vn) ∈ V n such that vi is adjacent to vi+1 for 1 ≤ i < n. Such a path P is called a path of length n from v1 to vn. Let ei,j be the edge incident to both vi and vj. Given a real-valued weight functi...

Nested certificates are used to certify their subject certificates. In this way, the subject certificates can be verified via their nested certificates without using signature verification methods based on public key cryptosystems. Such a verification method is called as subject certificate verification. In this paper, subject certificate verification method will be introduced. It will be shown...

This paper presents a genetic-algorithm-based approach to the problem of UAV path planning in dynamic environments. Variable-length chromosomes and their genes have been used for encoding the problem. We model the vehicle path as a sequence of speed and heading transitions occurring at discrete times, and this model specifically contains the vehicle dynamic constraints in the generation of tria...

Clickstream data provides information about the sequence of pages or the path viewed by users as they navigate a web site. We show how path information can be categorized and modeled using a dynamic multinomial probit model of web browsing. We estimate this model using data from a major online bookseller. Our results show that the memory component of the model is crucial in accurately predictin...

We study the general problem of computing an obstacle-avoiding path that, for a prescribed weight, minimizes the weighted sum of a smoothness measure and a safety measure of the path. We consider planar curvaturecontinuous paths, that are functions on an interval of a room axis, for a point-size vehicle amidst obstacles. The obstacles are two disjoint continuous functions on the same interval. ...