Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is ‘optimal’ in some way? In the domain of optimization this challenge is traditionally framed as the “Traveling Salesman Problem” (TSP). What strategies and ecological considerations are plausible for human navigation? When given a twodimensional map-like presentation of the des...

Current image acquisition and storage technologies have provided large data sets (with millions of samples) for analysis. Samples may be images from an image database, objects extracted from several images, or image pixels. This scenario is very challenging for traditional machine learning and pattern recognition techniques, which need to be more efficient and effective in large data sets. This...

System capacity is considered for a group of interfering users employing single user detection and multiple transmit and receive antennas for at Rayleigh fading channels with independent fading coeecients for each path. The focus is on the case where there is no channel state information at the transmitter, but channel state information is assumed at the receiver. It is shown that the optimum s...

In many path planning situations we would like to find a path of constrained Euclidean length in R2 that minimises a line integral. We call this the Continuous Length-Constrained Minimum Cost Path Problem (C-LCMCPP). Generally, this will be a non-convex optimization problem, for which continuous approaches only ensure locally optimal solutions. However, network discretisations yield weight cons...

This paper is aimed to find the optimum path of CNC turret typing system to reduce the changing tools times and optimize tool movement routes to make up for the deficiency of CNC Turret Typing machine production efficiency. An uncertainty polynomial model is raised based on the asymmetric traveling salesman problem. And genetic algorithm (GA) is used to solve the path optimization problem. The ...

Constraint programming is the study of system which is based on constraints. The solution of a constraint satisfaction problem is a set of variable value assignments, which satisfies all members of the set of constraints in the CSP. In this paper the application of constraint satisfaction programming is used in predicting the path loss of various indoor propagation models using chronological ba...

We develop a queueing model characterizing explicitly the impact of interference on end-to-end performance measures such as throughput in ad hoc networks, emphasizing the performance trade-off between single-path and multi-path routing. It may seem attractive to employ multi-path routing, but as all nodes share a single channel, efficiency may drop due to increased interference levels thus yiel...

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...

Economists traditionally tackle normative problems by computing optimal policy, i.e., the one that maximizes a social welfare function. In practice, however, a succession of marginal changes to a limited number of policy instruments are implemented, until no further improvement is feasible. I call such an outcome a “restricted local optimum”. I consider the outcome of such a tatonment process f...