Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods p...Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods proposed for fuel optimal orbital rendezvous, Lawden＇s primer vector theory is favored by many researchers with its clear physical concept and simplicity in solu- tion. Prussing has applied the primer vector optimization theory to minimum-fuel, multiple-impulse, time-fixed orbital ren- dezvous in a near circular orbit and achieved great success. Extending Prussing＇s work, this paper will employ the primer vec- tor theory to study trajectory optimization problems of arbitrary eccentricity elliptical orbit rendezvous. Based on linearized equations of relative motion on elliptical reference orbit （referred to as T-H equations）, the primer vector theory is used to deal with time-fixed multiple-impulse optimal rendezvous between two coplanar, coaxial elliptical orbits with arbitrary large ec- centricity. A parameter adjustment method is developed for the prime vector to satisfy the Lawden＇s necessary condition for the optimal solution. Finally, the optimal multiple-impulse rendezvous solution including the time, direction and magnitudes of the impulse is obtained by solving the two-point boundary value problem. The rendezvous error of the linearized equation is also analyzed. The simulation results confirmed the analyzed results that the rendezvous error is small for the small eccentric- ity case and is large for the higher eccentricity. For better rendezvous accuracy of high eccentricity orbits, a combined method of multiplier penalty function with the simplex search method is used for local optimization. The simplex search method is sensitive to the initial values of optimization variables, but the simulation results show that initial values with the primer vector theory, and the local optimization algorithm can improve the rendezvous accuracy effectively with fast convergence, because the optimal results obtained by the primer vector theory are already very close to the actual optimal solution.展开更多
Feature recognition is a process of extracting machining features which has engineering meaning from solid model, and it is a key technology of CAD/CAPP/CAM integration. This paper presents an effective and efficient ...Feature recognition is a process of extracting machining features which has engineering meaning from solid model, and it is a key technology of CAD/CAPP/CAM integration. This paper presents an effective and efficient methodology of recognizing machining feature. In this approach, features are classified into two categories： pocket feature and predefined feature. Different feature type adopts its special hint and heuristic rule, and is helpful to recognize intersection feature. Feature classification optimizes search algorithm and shortens search scope dramatically. Meanwhile, extension and split algorithm is used to handle intersecting feature. Moreover, feature mapping based on machining knowledge is introduced to support downstream application better. Finally, case studies with complex intersecting features prove that the developed approach has stronger recognizing ability.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos. 10832004 and 11072122)
文摘Rendezvous in circular or near circular orbits has been investigated in great detail, while rendezvous in arbitrary eccentricity elliptical orbits is not sufficiently explored. Among the various optimization methods proposed for fuel optimal orbital rendezvous, Lawden＇s primer vector theory is favored by many researchers with its clear physical concept and simplicity in solu- tion. Prussing has applied the primer vector optimization theory to minimum-fuel, multiple-impulse, time-fixed orbital ren- dezvous in a near circular orbit and achieved great success. Extending Prussing＇s work, this paper will employ the primer vec- tor theory to study trajectory optimization problems of arbitrary eccentricity elliptical orbit rendezvous. Based on linearized equations of relative motion on elliptical reference orbit （referred to as T-H equations）, the primer vector theory is used to deal with time-fixed multiple-impulse optimal rendezvous between two coplanar, coaxial elliptical orbits with arbitrary large ec- centricity. A parameter adjustment method is developed for the prime vector to satisfy the Lawden＇s necessary condition for the optimal solution. Finally, the optimal multiple-impulse rendezvous solution including the time, direction and magnitudes of the impulse is obtained by solving the two-point boundary value problem. The rendezvous error of the linearized equation is also analyzed. The simulation results confirmed the analyzed results that the rendezvous error is small for the small eccentric- ity case and is large for the higher eccentricity. For better rendezvous accuracy of high eccentricity orbits, a combined method of multiplier penalty function with the simplex search method is used for local optimization. The simplex search method is sensitive to the initial values of optimization variables, but the simulation results show that initial values with the primer vector theory, and the local optimization algorithm can improve the rendezvous accuracy effectively with fast convergence, because the optimal results obtained by the primer vector theory are already very close to the actual optimal solution.
文摘Feature recognition is a process of extracting machining features which has engineering meaning from solid model, and it is a key technology of CAD/CAPP/CAM integration. This paper presents an effective and efficient methodology of recognizing machining feature. In this approach, features are classified into two categories： pocket feature and predefined feature. Different feature type adopts its special hint and heuristic rule, and is helpful to recognize intersection feature. Feature classification optimizes search algorithm and shortens search scope dramatically. Meanwhile, extension and split algorithm is used to handle intersecting feature. Moreover, feature mapping based on machining knowledge is introduced to support downstream application better. Finally, case studies with complex intersecting features prove that the developed approach has stronger recognizing ability.
