Abstract    In the last two decades, autonomous vehicles have received a widespread use and attention. In this thesis, navigation of such machines is investigated. Path planning is one of the important part of this navigation. Duo to the long-term use of roads and lack of their maintenance, the roads which autonomous vehicles need to pass have tracks. In these cases, while an autonomous vehicle passes through these cracked areas at high speed, it will increase the sense of bump and even deviate from the originally planned route. Further, this may potentially cause vehicle damage. In this thesis, an adjustable speed navigation method, called Bat-Pigeon algorithms is investigated. First a review on heuristic and meta-heuristic algorithms is presented. After that, Bat-algorithm and Pigeon-algorithm for optimization are studied. Next, an image processing technique is introduced and by using of that process a combination of Bat- and Pigeon- algorithms, that is Bat-Pigeon-algorithm, is investigated for navigation and path planning of autonomous vehicles.       Keywords: Heuristic algorithm, Meta-heuristic algorithm, Swarm-intelligence optimization, Bat-algorithm, Pigeon-algorithm, Autonomous vehicle, Bat-Pigeon algorithm, Path planning, Road track detection, Image processing.   

   Let nq(k‎, ‎d) be the minimum length n for which an [n‎, ‎k‎, ‎d] q-code exists‎. In coding theory‎, ‎there is a natural lower bound on nq(k‎, ‎d) ‎, ‎the Griesmer bound‎: nq(k‎, ‎d) ? gq(k‎, ‎d) =‎‎i=0k-1[dqi] ‎.‎ ‎In this thesis‎,   ‎a lot of new [n‎, ‎4‎, ‎d] 9-codes whose lengths are close to the Griesmer‎ bound were be constructed‎. ‎Also‎, ‎we prove the nonexistence of some linear codes attaining the Griesmer bound‎ using some geometric techniques through projective geometries to determine the‎ exact value of n9(4‎, ‎d) or to improve the known bound on n9(4‎, ‎d) for given values‎ of d‎. ‎Finally‎, ‎the updated table for n9

  دراين پايان نامه وجود جواب هاي ضعيف براي يك دستگاه معادلات كيرشهف كسري منفرد و ‎دسته‎ اي از معادلات كيرشهف كسري منفرد با توابع وزن داراي تغيير علامت، با استفاده از روش منيفلد نهاري مورد بررسي قرار مي گيرد. ‌‌‌‌‌‌‌‌‌براي اينكار متناظر با نقاط بحراني نگاشت هاي تاري، منيفلد نهاري به سه زيرمجموعه تقسيم مي شود. به علاوه ثابت مي شود تابعك انرژي روي منيفلد نهاري بازدارنده و از پايين كراندار است و مينيمم هاي موضعي روي منيفلد نهاري نقاط بحراني تابعك انرژي هستند. سپس با نشان دادن وجود دو مينيمم موضعي روي زير مجموعه هاي متناظر با نقاط ماكسيمم و مينيمم نگاشت هاي تاري، وجود دو نقطه بحراني براي تابعك انرژي اثبات خواهد شد.

A J-frame for a Krein space H is in particular a frame for H (in the Hilbert space sense).But it is also compatible with the indefinite inner-product of H meaning that it determines a pair of maximal uniformly definite subspace.

 complex linear systems have many applications in scientific computing and applied engineering most of these equations don't have exact solution.therefore the main purpose of this thesis is to obtain some numerical methods for solving these equations.by obtaining the spectral radius of the introduced method,their convergence analysis will beinvestigated.finally by some numerical examples efficiencity of the methods will be explained

A numerical scheme for a fractional sub-diffusion problem using parametric quantic spline

In this thesis first, some concepts and theorems of sobolev space are explianed.Then the existence of nontrivial wenk solutions for a class of quasilinear Schrodinger

  A trust-region-based algorithm for the nonconvex unconstrained multiobjective optimization problem is considered. It is a generalization of the algorithm proposed by Fliege et al. for convex problems. Similarly to the scalar case, at each iteration a subproblem is solved and the step needs to be evaluated. Therefore, the notions of decrease condition and of predicted reduction are adapted to the vectorial case. A rule to update the trust region radius is introduced. Under differentiability assump- tions, the algorithm converges to points satisfying a necessary condition for Pareto points and, in the convex case, to a Pareto points satisfying necessary and sufficient conditions. Furthermore, it is proved that the algorithm displays a q-quadratic rate of convergence. The global behavior of the algorithm is shown in the numerical ex- perience reported. Keyword: Multicriteria optimization, Multiobjective programming, Pareto points, Newton’s method ,Trust region.