For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...

We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game-theoretic approach and graph decompositions called q-branched tree decompositions, which can be interpreted as a parameterized version of tre...

Route game is recognized as an effective method to alleviate Braess’ paradox, which generates a new traffic congestion since numerous vehicles obey the same guidance from selfish route (such Google Maps). The conventional games have symmetry vehicles’ payoffs depend only on selected distribution but not who chose, leads precise Nash equilibrium being able be solved by constructing special poten...

Let L = Q[α] be an abelian number field of prime degree q, and let a be a nonzero rational number. We describe an algorithm which takes as input a and the minimal polynomial of α over Q, and determines if a is a norm of an element of L. We show that, if we ignore the time needed to obtain a complete factorization of a and a complete factorization of the discriminant of α, then the algorithm run...

We consider the linear complementarity problem (LCP): Mz + q ≥ 0, z ≥ 0, z′(Mz + q) = 0 as an absolute value equation (AVE): (M + I)z + q = |(M − I)z + q|, where M is an n× n square matrix and I is the identity matrix. We propose a concave minimization algorithm for solving (AVE) that consists of solving a few linear programs, typically two. The algorithm was tested on 500 consecutively generat...

We describe an algorithm for explicitly listing the irreducible monomial subgroups of GL(n, q) , given a suitable list of finite irreducible monomial subgroups of GL(n, C) , where n is 4 or a prime, and q is a prime power. Particular attention is paid to the case n = 4, and the algorithm is illustrated for n = 4 and q = 5. Certain primitive permutation groups can be constructed from a list of i...

A kind of weighted Q-Learning algorithm suitable for control systems with continuous state and action spaces was proposed. The hidden layer of RBF network was designed dynamically by virtue of the proposed modified growing neural gas algorithm so as to realize the adaptive understanding of the continuous state space. Based on the standard Q-Learning implemented by RBF network, the weighted Q-Le...