基于不同活动方式的商业路径塑造——以荥阳新城吾悦广场方案设计为例

成功的商业综合体规划设计是在很多因素的共同作用下出现的,一个好的商业规划设计可以带给游客良好的商业体验,并且在提高商业服务质量的同时,使游客更容易找到相应的商业动线,避免由于商业动线过长而导致商业活动效率过低,以及流线的相互干扰。商业综合体的商业模式为大型商场加外环小型商铺,一般认为,游客在这种商场空间中行走的时间会多于购物的时间,造成时间上的浪费。综上所述,优化商业街的空间界面设计与探究路径规划设计非常重要。

Radial Based Probabilistic Roadmap Motion Planning Method in Sparse Environment

A new dynamic path planning method in high dimensional workspace, radial based probabilistic roadmap motion (RBPRM) planning method, is presented. Different from general probabilistic roadmap motion planning methods, it uses straight lines as long as possible to construct a path graph, so the final path obtained from the graph is relatively shorter and straighter. Experimental results show the efficiency of the algorithm in finding shorter paths in sparse environment.

Energy saving analysis of segment positioning in shield tunneling machine considering assembling path optimization

A motion parameter optimization method based on the objective of minimizing the total energy consumption in segment positioning was proposed for segment erector of shield tunneling machine. The segment positioning process was decomposed into rotation, lifting and sliding actions in deriving the energy calculation model of segment erection. The work of gravity was taken into account in the mathematical modeling of energy consumed by each actuator. In order to investigate the relationship between the work done by the actuator and the path moved along by the segment, the upward and downward directions as well as the operating quadrant of the segment erector were defined. Piecewise nonlinear function of energy was presented, of which the result is determined by closely coupled components as working parameters and some intermediate variables. Finally, the effectiveness of the optimization method was proved by conducting a case study with a segment erector for the tunnel with a diameter of 3 m and drawing comparisons between different assembling paths. The results show that the energy required by assembling a ring of segments along the optimized moving path can be reduced up to 5%. The method proposed in this work definitely provides an effective energy saving solution for shield tunneling machine.

An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization. II. Problems with Path Constraints

This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.

3DT-PP:localization and path planning of mobile anchors over complex 3D terrains

Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.

An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization (Ⅰ) Problems Without Path Constraints

This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.

BSDE,path-dependent PDE and nonlinear Feynman-Kac formula

We introduce a new type of path-dependent quasi-linear parabolic PDEs in which the continuous paths on an interval [0, t] become the basic variables in the place of classical variables （t, x） ∈[0, T]× R^d. This new type of PDEs are formulated through a classical BSDE in which the terminal values and the generators are allowed to be general function of Brownian motion paths. In this way, we establish the nonlinear Feynman- Kac formula for a general non-Markoviau BSDE. Some main properties of solutions of this new PDEs are also obtained.