초록 ▼

The conversion of energy regularly results in losses in the form of heat. This applies both for the conversion of kinetic energy of wind into electrical energy in the generator of a wind energy facility, where these losses regularly occur in the main driving line of the wind energy facility, and als

The conversion of energy regularly results in losses in the form of heat. This applies both for the conversion of kinetic energy of wind into electrical energy in the generator of a wind energy facility, where these losses regularly occur in the main driving line of the wind energy facility, and also for the electrical feeding of energy generated by the wind energy facility into a medium voltage network. For this purpose, regular devices of power electronics, e.g., rectifiers, and/or transformers, are necessary. In the main driving line, which is mounted in the nacelle for a wind energy facility, the losses occur overwhelmingly in the gears, at the bearings, and in the generator or at other control units, such as, e.g., in the hydraulic systems or similar control and regulation units, which adjust the rotor blades or turn the wind energy facility into the wind. For gearless wind energy facilities, e.g., model E-66 of Enercon, the main losses occur at the main driving line in the generator, i.e., in the nacelle (head) of the wind energy facility. The task of the invention is to prevent the previously mentioned disadvantages and to provide a cooling device for a wind energy facility, which reduces the losses of the wind energy facility. Wind energy facility with a completely closed or at least partially closed cooling circuit, with which the heat to be dissipated from the cooling circuit is dissipated by the tower or the nacelle of the wind energy facility.

대표청구항 ▼

The conversion of energy regularly results in losses in the form of heat. This applies both for the conversion of kinetic energy of wind into electrical energy in the generator of a wind energy facility, where these losses regularly occur in the main driving line of the wind energy facility, and als

The conversion of energy regularly results in losses in the form of heat. This applies both for the conversion of kinetic energy of wind into electrical energy in the generator of a wind energy facility, where these losses regularly occur in the main driving line of the wind energy facility, and also for the electrical feeding of energy generated by the wind energy facility into a medium voltage network. For this purpose, regular devices of power electronics, e.g., rectifiers, and/or transformers, are necessary. In the main driving line, which is mounted in the nacelle for a wind energy facility, the losses occur overwhelmingly in the gears, at the bearings, and in the generator or at other control units, such as, e.g., in the hydraulic systems or similar control and regulation units, which adjust the rotor blades or turn the wind energy facility into the wind. For gearless wind energy facilities, e.g., model E-66 of Enercon, the main losses occur at the main driving line in the generator, i.e., in the nacelle (head) of the wind energy facility. The task of the invention is to prevent the previously mentioned disadvantages and to provide a cooling device for a wind energy facility, which reduces the losses of the wind energy facility. Wind energy facility with a completely closed or at least partially closed cooling circuit, with which the heat to be dissipated from the cooling circuit is dissipated by the tower or the nacelle of the wind energy facility. s dynamically communicated to the display. 2. The device of claim 1, further comprising an interface device operable to audibly communicate the route path. 3. The device of claim 1, wherein the first locations are removed from the first data structure as the first locations become part of the route path and the removed first locations combine to form a second data structure. 4. The device of claim 1, wherein the first data structure is a treap and the second data structure is a binary tree. 5. The device of claim 1, wherein the display regularly displays the moveable location relative to the destination. 6. The device of claim 1, wherein the device dynamically resolves the moveable location using a triangulation algorithm. 7. The device of claim 1, wherein the device is a portable electronic device. 8. The device of claim 1, wherein the memory is remote from the processor. 9. A navigation system, comprising: a mass storage device adapted to store navigation data; a server adapted to communicate with the mass storage; and a navigation device adapted to communicate with and retrieve navigation data from the server via a communication channel, wherein the navigation device includes a processor in communication with a memory, wherein the processor and memory cooperate to: generate a projected route from a starting location, one or more available locations, and an ending location, wherein each available location has an associated cost and each available location is evaluated as the projected route is constructed if an available location is adjacent to a last inserted available location and has a least cost when compared to costs associated with all available adjacent locations, wherein adjacent locations are inserted into a first data structure such that a first location of the first data structure is a least cost location of the data structure, and wherein the first data structure is a treat. 10. The system of claim 9, wherein the communication channel includes a wireless channel. 11. The system of claim 9, wherein the projected route is stored as a second data structure. 12. The system of claim 11, wherein the second data structure is a binary tree. 13. A computer-readable medium encoded with functional data to select an optimal route, comprising: a beginning node representative of an initial geographic location; a destination node representative of a desired geographic location; an optimal route, wherein the optimal route is a path starting with the beginning node and including one or more selected intermediate nodes and ending with the destination node; and one or more available nodes wherein each available node includes a cost associated with including each available node in the path as one of the selected intermediate nodes, wherein as one or more of the available nodes become available for inspection the available nodes are organized as a first data structure, wherein a least cost available node is a first node of the data structure and wherein the first data structure is a treap. 14. The computer-readable medium of claim 13, further comprising a second data structure operable to house the beginning node, the selected intermediate nodes, and the destination node. 15. The computer-readable medium of claim 14, wherein the second data structure is a binary tree. 16. The computer-readable medium of claim 15, wherein the binary tree is traversed to generate the optimal route. 17. The computer-readable medium of claim 13, wherein one or more of the available nodes become available for inspection only when adjacent to a last selected node. 18. The computer-readable medium of claim 13, further comprising: a third data structure operable to include a unique identification for the beginning node, the available nodes, and the ending node and operable to include cartographic data associated with each unique identification. 19. The computer-readable medium of claim 13, wherein the organization of the first data s tructure decreases a memory requirement associated with generating the optimal route in a navigation device. 20. A method of generating a projected route, comprising: receiving an initial starting location and an ending location; identifying one or more available locations existing between the starting location and the ending location; beginning with the stating location and proceeding to the ending location initiating a first evaluation by selecting one or more adjacent locations from the available locations and as one or more of the adjacent locations are selected inserting each of the selected adjacent locations into a first data structure, wherein a first location of the first data structure is always associated with a least cost location of the first data structure and the first data structure is a treap; and generating the projected route from the starting location, one or more of the selected adjacent locations which occupy the first location of the first data structure, and the ending location. 21. The method of claim 20, further comprising: communicating the projected route to a navigation device. 22. The method of claim 20, further comprising: concurrent with the first evaluation, initiating a second evaluation beginning with the ending location and proceeding to the starting location and selecting one or more second adjacent locations from the available locations and as one or more of the second adjacent locations are selected inserting each of the second selected adjacent locations into a second data structure, wherein a first location of the second data structure is always a least cost location of the second data structure; and detecting when a convergence exists in the first evaluation and the second evaluation and using the first evaluation and the second evaluation in forming the projected route. 23. The method of claim 22, wherein the proceeding with the evaluations occur dynamically as the starting location changes. 24. The method of claim 20, further comprising: determining the least cost location of the first data structure by determining a time or a distance of travel from a last selected adjacent location to a last least cost location of the first data structure. 25. The method of claim 24, wherein the determining the least cost location includes adding an estimated travel time or distance associated with traveling from the least cost location to the ending location with the time or distance of travel from the last selected adjacent location to the last least cost location of the first data structure. 26. The method of claim 20, wherein in generating the projected route the starting location, one or more of the selected adjacent locations, and the ending location comprise a second data structure. 27. The method of claim 26, wherein the proceeding with the first evaluation includes generating the projected route where a binary tree is the second data structure. 28. The method of claim 20, wherein the method is used in connection with an electronic navigational aid device.