{"entities":{"Q2924698":{"pageid":2935418,"ns":120,"title":"Item:Q2924698","lastrevid":85168355,"modified":"2026-06-03T06:08:23Z","type":"item","id":"Q2924698","labels":{"en":{"language":"en","value":"Reentry trajectory optimization based on an improved genetic algorithm and sequential quadratic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6365079"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2924698$A054AFFA-9ECB-4E01-A620-C61F8052655A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"dcf3b2d67504651b04018bb8309706899997fc80","datavalue":{"value":"1313.90273","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2924698$FB1A8004-5F3B-4DF9-A123-1278E58106B2","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8d893ccccba7763c68dd449aeab598fae0253b66","datavalue":{"value":{"entity-type":"item","numeric-id":1649723,"id":"Q1649723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2924698$C4AB6BBD-D679-423A-A93D-FF0F5CE264E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2f1e3539b76a63afac6a0405f84734d808e2d90c","datavalue":{"value":{"entity-type":"item","numeric-id":6490889,"id":"Q6490889"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2924698$53802D70-A4C7-4BA4-94AB-EC5C519C7E97","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3daa83eb5c9d67846bd0433e54bd3c467e1d5cf9","datavalue":{"value":{"time":"+2014-11-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2924698$13E64798-7B97-4994-A204-0E97E85EA68D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2924698$D9044297-2791-4471-A5CF-29C0A526B1F7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2924698$C05D6749-0D13-44A3-AC27-110C0BD30478","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2924698$88329030-9DC6-49DE-BB1C-E9F0980A5D18","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5f5adc1e626c87a21c692ce5969e208a99f5d3f6","datavalue":{"value":"6365079","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2924698$F7C787DC-7E40-45C7-B387-4F13C5A1DE84","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"68b1f1c8edf57ff9fe554e3b4126dbb674004bf9","datavalue":{"value":"direct collocation method","type":"string"},"datatype":"string"},"type":"statement","id":"Q2924698$D3C05947-CEC6-4DE2-9FEA-F54BD34C037D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"605eaf52a7d40b4ca440dd997a658542e33d5665","datavalue":{"value":"simulated annealing","type":"string"},"datatype":"string"},"type":"statement","id":"Q2924698$F8B22DBC-AADB-43C2-A440-29504A1851D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a82288a7486575dda773cb2a6b464589e07fba88","datavalue":{"value":"genetic algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2924698$D7A06BAA-10EE-4EB7-82F6-EEF040F17D72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b358739109f3afdacd1bd294edeb95ae3d4a9bc0","datavalue":{"value":"sequential quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2924698$189A4D47-7BE6-44D3-9170-9E5AD5974A78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"038df6312fbc89a7f274d07e9e56fa569455f35f","datavalue":{"value":"reusable launch vehicle","type":"string"},"datatype":"string"},"type":"statement","id":"Q2924698$FF8BE9E7-AD1B-4C5B-9E54-00551E177148","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2924698$F38565E5-0D1E-4EE9-87BF-3F9656524B82","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f349996ee3653d86bf3f1bc1d1c697151542f260","datavalue":{"value":{"text":"Reentry trajectory optimization based on an improved genetic algorithm and sequential quadratic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2924698$07C20512-F815-4809-A2FF-84C1A9B41CC0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a7dffb75ea3787b8961d8d428691bfabf3f4a795","datavalue":{"value":{"entity-type":"item","numeric-id":6768151,"id":"Q6768151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2924698$1B28E246-CF74-4A63-8D3E-700EA0FDF65C","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1697e828b17388ea04676c43ffdd74966fef05de","datavalue":{"value":{"entity-type":"item","numeric-id":5851263,"id":"Q5851263"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8eefc81be2af434f6ddc044f62f7fc2323baa3dc","datavalue":{"value":{"amount":"+0.8536784648895264","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2924698$5D25858C-7A4E-4504-BD66-DC36BE975F42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1635fe02fc00fa00287428121b494adea9060f56","datavalue":{"value":{"entity-type":"item","numeric-id":5270068,"id":"Q5270068"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b5c52d54b451f8a01264f07293fd095bacc3ed03","datavalue":{"value":{"amount":"+0.7805164456367493","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2924698$3EB46E7F-5A72-47A9-8B09-BDD242B48A80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"33de0de877ef757c57ffe961394a9fa0a2cd606e","datavalue":{"value":{"entity-type":"item","numeric-id":4527351,"id":"Q4527351"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"de628c68d0c9c7624afefb832cdd8a352c787a45","datavalue":{"value":{"amount":"+0.7572215795516968","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2924698$7135D999-AE70-4561-A38D-5A64AD1AD156","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d80971b569130dcd851a5e18387f309291336aec","datavalue":{"value":{"entity-type":"item","numeric-id":5231422,"id":"Q5231422"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"04c6ba308b8da65bec9a3371fb6e6e0df67c874c","datavalue":{"value":{"amount":"+0.7538589239120483","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2924698$F389206C-6418-4A86-98A7-270BA3441DAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d905e0788051fa2d20ad876e3c9c62916577362e","datavalue":{"value":{"entity-type":"item","numeric-id":2027391,"id":"Q2027391"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"36b3309b88ce633d7ab0ac5ae0fdb86da258d7ba","datavalue":{"value":{"amount":"+0.751582682132721","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2924698$43B794BD-1767-4179-9381-B66D9BC91A11","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Reentry trajectory optimization based on an improved genetic algorithm and sequential quadratic programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Reentry_trajectory_optimization_based_on_an_improved_genetic_algorithm_and_sequential_quadratic_programming"}}}}}