一种用于室内定位的线性规划算法

针对基于ToA定位中存在的信标节点较少和发送时间不能提前预知的问题，提出了一种新的应用于无线传感网络室内定位的线性规划算法.通过考虑测量值的最小平均绝对值误差，利用线性逼近方法，将一个复杂的、非凸的室内定位问题转换为一个简单的线性规划问题，并用迭代求精的方法求出最优解.仿真结果表明，提出算法计算复杂度低，收敛速度快，可以快速地求出未知节点的坐标；通过和已有的定位算法相比，提出算法在信标节点较少的情况下，仍能保持很好的定位精度，利用较少的节点资源达到比已有算法更好的定位性能.
To solve the problem of fewer beacon nodes and unknown transmission time in Time of Arrival (ToA) based localization, a new linear programming algorithm was proposed to approximate nonlinear localization estimation problems. We consider the least mean absolute errors of the residual and formulate the nonconvex localization problem as a simple linear programming by using linear approximation. Simulation results demonstrate that the proposed algorithm can maintain good positioning accuracy under fewer beacon nodes and achieve better performance by using less node resources than the existing algorithms.