in this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. it is assumed that the robot performs navigation in unknown environment and builds the map through slam procedure. since the moving objects' location and properties are unknown, they are identified and tracked by kalman filter. kalm...

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. an integer programming model is formulated for the project portfolio selection and scheduling.two heuristic algorithms, genetic algorithm (ga) and simulated annealing (sa), are presented to solve the problem. results of cal...

traditional leveraging statistical methods for analyzing today’s large volumes of spatial data have high computational burdens. to eliminate the deficiency, relatively modern data mining techniques have been recently applied in different spatial analysis tasks with the purpose of autonomous knowledge extraction from high-volume spatial data. fortunately, geospatial data is considered a proper s...

in this paper, we deal with the problem of clutter and direct signal (c&ds;) cancelation in the target detection of tv-based passive radars. we first consider the target detection using the conventional fft method. we see that for increasing the maximum range of passive radar, we must cancel the c&ds; from the received signal. hence, we investigate some important methods for c&ds; cancelation i...

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...