develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining...develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.展开更多
A novel underwater localization algorithm for autonomous underwater vehicle(AUVs) is proposed. Taking aim at the high cost of the traditional "leader-follower" positioning,a "parallel" model is ado...A novel underwater localization algorithm for autonomous underwater vehicle(AUVs) is proposed. Taking aim at the high cost of the traditional "leader-follower" positioning,a "parallel" model is adopted to describe the localization problem. Under an unknown-but-bounded assumption for sensor noise,bearing and range measurements can be modeled as linear constraints on the configuration space of the AUVs. Merged these constraints,a convex polyhedron representing the set of all configurations consistent with the sensor measurements can be induced. Estimates for the uncertainty in the position of a single AUV or the relative positions of two or more AUVs can then be obtained by projecting this polyhedron into appropriate subspaces of the configuration space. The localization uncertain region for each AUV can be recovered by an approximation algorithm to realize underwater localization for multiple AUVs. The deduced theoretically and the simulated results show that it is an economical and practical localization method for the AUV swarm.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.11371001
文摘develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.
基金Sponsored by National Natural Foundation (50979093)High Technology Research and Development Program of China (2007AA809502C)Program for New Century Excellent Talents in University (NCET-06-0877)
文摘A novel underwater localization algorithm for autonomous underwater vehicle(AUVs) is proposed. Taking aim at the high cost of the traditional "leader-follower" positioning,a "parallel" model is adopted to describe the localization problem. Under an unknown-but-bounded assumption for sensor noise,bearing and range measurements can be modeled as linear constraints on the configuration space of the AUVs. Merged these constraints,a convex polyhedron representing the set of all configurations consistent with the sensor measurements can be induced. Estimates for the uncertainty in the position of a single AUV or the relative positions of two or more AUVs can then be obtained by projecting this polyhedron into appropriate subspaces of the configuration space. The localization uncertain region for each AUV can be recovered by an approximation algorithm to realize underwater localization for multiple AUVs. The deduced theoretically and the simulated results show that it is an economical and practical localization method for the AUV swarm.
