排序方式: 共有40条查询结果,搜索用时 500 毫秒
1.
介绍了普通的时间实验室的时频测量,实现自动测量和数据收集的基本系统方案,并以上海天文台原子时实验室为例介绍了实际可行的自动测量和数据收集系统,这个系统高性能、低价格,可应用于国内几乎所有的时间实验室。 相似文献
2.
以9500示波器自动检定系统为例,介绍了在VB6.0开发环境下,引用其强大的数据库功能。通过建立9500程控代码数据库、仪器登记数据库、检定参数设置信息库、检定结果信息库,实现了各库之间的数据访问和存储,达到了对各种示波器的半自动和全自动检定。并将部分代码加以介绍,可以直接在其它自动测试中应用,因此具有广泛的应用和借鉴价值。 相似文献
3.
4.
5.
介绍了欧空局的自动转移飞行器(ATV)的轨道控制方案和技术。给出了ATV的飞行方案、测量敏感器和执行机构的配置,以及在空间站调相段、寻的段、接近段和最终逼近段的轨控策略。 相似文献
6.
Ravi teja Nallapu Jekan Thangavelautham 《Advances in Space Research (includes Cospar's Information Bulletin, Space Research Today)》2021,67(11):3559-3582
This work describes the design and optimization of spacecraft swarm missions to meet spatial and temporal visual mapping requirements of missions to planetary moons, using resonant co-orbits. The algorithms described here are a part of Integrated Design Engineering and Automation of Swarms (IDEAS), a spacecraft swarm mission design software that automates the design trajectories, swarm, and spacecraft behaviors in the mission. In the current work, we focus on the swarm design and optimization features of IDEAS, while showing the interaction between the different design modules. In the design segment, we consider the coverage requirements of two general planetary moon mapping missions: global surface mapping and region of interest observation. The configuration of the swarm co-orbits for the two missions is described, where the participating spacecraft have resonant encounters with the moon on their orbital apoapsis. We relate the swarm design to trajectory design through the orbit insertion maneuver performed on the interplanetary trajectory using aero-braking. We then present algorithms to model visual coverage, and collision avoidance in the swarm. To demonstrate the interaction between different design modules, we relate the trajectory and swarm to spacecraft design through fuel mass, and mission cost estimations using preliminary models. In the optimization segment, we formulate the trajectory and swarm design optimizations for the two missions as Mixed Integer Nonlinear Programming (MINLP) problems. In the current work, we use Genetic Algorithm as the primary optimization solver. However, we also use the Particle Swarm Optimizer to compare the optimizer performance. Finally, the algorithms described here are demonstrated through numerical case studies, where the two visual mapping missions are designed to explore the Martian moon Deimos. 相似文献
7.
8.
We investigate the relation between nontrivial spatial concepts such as holes and string loops from a qualitative spatial reasoning perspective. In particular, we concentrate on a family of puzzles dealing with this kind of objects and explain how a loop formed in a string shows a similar behavior to a hole in an object, at least regarding the qualitative constraints it imposes on the solution of the puzzle. Unlike regular holes, however, we describe how string loops can be dynamically created and destroyed depending on the actions on the string. Furthermore, under a Knowledge Representation point of view, we provide a formalization that allows the different puzzle states to be described in terms of string crossings and loops, together with the actions that can be executed for a state transition and the complex effects they cause on the state representation. This implies the consideration of a formal representation of the side effects of actions that create or destroy string loops and the soundness of this representation with respect to the more general representation of string states in knot theory. 相似文献
9.
10.