重钢新区铁区MES系统研究与实施

针对重钢集团环保搬迁铁区生产单元信息化建设具体要求,开发并实施铁区MES系统,同时简要介绍系统功能及应用效果。     

健康管理企业电子商务系统的规划与设计

健康管理企业电子商务系统以营养配餐、饮食宜忌、健康评估、电子健康档案等为基础,兼顾遗传、饮食、生活习惯、职业等因素,以营养保健协会、预防医疗机构等专业科研机构为依托,利用互联网全天候的优势,对身体状况进行跟踪预测,对疾病进行早期预警。通过本系统不但为大家提供全方位的个性化健康管理服务,为健康保驾护航,而且极大地提高了健康管理企业的竞争力和效率。     

无线传感器网络节点定位的移动信标节点路径规划

为了进一步提高无线传感器网络节点定位精度和覆盖率,本文在采用移动信标节点来对未知节点进行定位方面,提出了信标节点向最大覆盖未定位节点方向移动的路径规划算法,解决了信标节点的移动路径规划问题.仿真实验表明,和信标节点随机方向移动算法相比,该算法具有较好的定位性能,能很好地适应大规模随机不均匀撒布节点的应用需求.     

一种基于PSO的多UAV协同航迹规划方法

本文针对多无人飞行器(UAV)协同执行任务的应用场景,提出了一种综合考虑任务分配和航迹规划因素的航迹规划算法。该算法借鉴微粒群算法(PSO)的思想,采用新的编码方式和优化策略。仿真实验验证了算法的有效性。     

Camera Control in Computer Graphics

Recent progress in modelling, animation and rendering means that rich, high fidelity virtual worlds are found in many interactive graphics applications. However, the viewer's experience of a 3D world is dependent on the nature of the virtual cinematography, in particular, the camera position, orientation and motion in relation to the elements of the scene and the action. Camera control encompasses viewpoint computation, motion planning and editing. We present a range of computer graphics applications and draw on insights from cinematographic practice in identifying their different requirements with regard to camera control. The nature of the camera control problem varies depending on these requirements, which range from augmented manual control (semi‐automatic) in interactive applications, to fully automated approaches. We review the full range of solution techniques from constraint‐based to optimization‐based approaches, and conclude with an examination of occlusion management and expressiveness in the context of declarative approaches to camera control.     

Real-time crowd motion planning

Real-time crowd motion planning requires fast, realistic methods for path planning as well as obstacle avoidance. In a previous work (Morini et al. in Cyberworlds International Conference, pp. 144–151, 2007), we introduced a hybrid architecture to handle real-time motion planning of thousands of pedestrians. In this article, we present an extended version of our architecture, introducing two new features: an improved short-term collision avoidance algorithm, and simple efficient group behavior for crowds. Our approach allows the use of several motion planning algorithms of different precision for regions of varied interest. Pedestrian motion continuity is ensured when switching between such algorithms. To assess our architecture, several performance tests have been conducted, as well as a subjective test demonstrating the impact of using groups. Our results show that the architecture can plan motion in real time for several thousands of characters.

Siting park-and-ride facilities using a multi-objective spatial optimization model

Park-and-ride services are an important component of many public transportation systems in the United States. Locating park-and-ride facilities is an essential step when planning for these services. In this research we focus on three major siting/modeling concerns that need to be addressed when siting park-and-ride facilities: covering as much potential demand as possible, locating park-and-ride facilities as close as possible to major roadways, and siting such facilities in the context of an existing system. Unfortunately, existing models do not enable each of these concerns to be simultaneously addressed. This paper presents a multi-objective spatial optimization model for integrating these considerations. This model is applied for siting park-and-ride facilities in Columbus, Ohio. Application results show the usefulness of the developed model in supporting transit planning in an urban region.     

Multi-behavior agent model for planning in supply chains: An application to the lumber industry

Recent economic and international threats to western industries have encouraged companies to increase their performance in all ways possible. Many look to deal quickly with disturbances, reduce inventory, and exchange information promptly throughout the supply chain. In other words they want to become more agile. To reach this objective it is critical for planning systems to present planning strategies adapted to the different contexts, to attain better performances. Due to consolidation, the development of integrated supply chains and the use of inter-organizational information systems have increased business interdependencies and in turn the need for increased collaboration to deal with disturbance in a synchronized way. Thus, agility and synchronization in supply chains are critical to maintain overall performance. In order to develop tools to increase the agility of the supply chain and to promote the collaborative management of such disturbances, agent-based technology takes advantage of the ability of agents to make autonomous decisions in a distributed network through the use of advanced collaboration mechanisms. Moreover, because of the highly instable and dynamic environment of today's supply chains, planning agents must handle multiple problem solving approaches. This paper proposes a Multi-behavior planning agent model using different planning strategies when decisions are supported by a distributed planning system. The implementation of this solution is realized through the FOR@C experimental agent-based platform, dedicated to supply chain planning for the lumber industry.     

Theory and implementation of path planning by negotiation for decentralized agents

This paper presents a cooperative decentralized path-planning algorithm for a group of autonomous agents that provides guaranteed collision-free trajectories in real-time. The algorithm is robust with respect to arbitrary delays in the wireless traffic, possible sources being transmission time and error correction. Agents move on reserved areas which are guaranteed not to intersect, therefore ensuring safety. A handshaking procedure guarantees recent information states for the agents. Conflicts between agents are resolved by a cost-based negotiation process. The basic algorithm is augmented by the introduction of waypoints, which increase performance at the cost of additional wireless traffic. An implementation of the algorithm is tested in simulation and successfully applied to a real system of autonomous robots. The results are presented and discussed.     

Motion Planning for Haptic Guidance

Haptic devices allow a user to feel either reaction forces from virtual interactions or reaction forces reflected from a remote site during a bilateral teleoperation task. Also, guiding forces can be exerted to train the user in the performance of a virtual task or to assist him/her to safely teleoperate a robot. The generation of guiding forces relies on the existence of a motion plan that provides the direction to be followed to reach the goal from any free configuration of the configuration space (-space). This paper proposes a method to obtain such a plan that interleaves a sampling-based exploration of -space with an efficient computation of harmonic functions. A deterministic sampling sequence (with a bias based on harmonic function values) is used to obtain a hierarchical cell decomposition model of -space. A harmonic function is iteratively computed over the partially known model using a novel approach. The harmonic function is the navigation function used as motion plan. The approach has been implemented in a planner (called the Kautham planner) that, given an initial and a goal configuration, provides: (a) a channel of cells connecting the cell that contains the initial configuration with the cell that contains the goal configuration; (b) two harmonic functions over the whole -space, one that guides motions towards the channel and another that guides motions within the channel towards the goal; and (c) a path computed over a roadmap built with the free samples of the channel. The harmonic functions and the solution path are then used to generate the guiding forces for the haptic device. The planning approach is illustrated with examples on 2D and 3D workspaces. This work was partially supported by the CICYT projects DPI2005-00112 and DPI2007-63665.