{"entities":{"Q5117703":{"pageid":7147277,"ns":120,"title":"Item:Q5117703","lastrevid":91507199,"modified":"2026-06-04T23:20:56Z","type":"item","id":"Q5117703","labels":{"en":{"language":"en","value":"Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7239973"}},"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":"Q5117703$DF50A3AF-42F9-4A4E-B2D6-27FDE8BA5004","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bb7025ad343890069ad9206f53d72961d911cebc","datavalue":{"value":{"text":"Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5117703$5C0DACF2-5C25-49FF-866F-EEDACDFE8C13","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"00dab7a367e75856a273044da54273eaad1abc4d","datavalue":{"value":"10.1007/978-981-15-3425-6_8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5117703$8C9C8CDA-A265-429F-B8D3-BD070A8F6E78","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c63b51bfd308d5360e4d47597f01d8c3fe888978","datavalue":{"value":{"entity-type":"item","numeric-id":5117700,"id":"Q5117700"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$CDD68725-599C-4715-9CCA-1473AF34A3CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fee67b7138480262a407cb52bbdafa79f98a7644","datavalue":{"value":{"entity-type":"item","numeric-id":219005,"id":"Q219005"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$E6E52234-5C70-4BD8-BEF4-E8D55F093B8F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e740cf22a0abdaa82a1fb3aa7eb9ac6840179e3f","datavalue":{"value":{"entity-type":"item","numeric-id":5117701,"id":"Q5117701"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$85923571-4238-47A0-B751-B248D7A2CB47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7b078e8e0b3a177a674e9e5151e21cc654b13095","datavalue":{"value":{"entity-type":"item","numeric-id":5117702,"id":"Q5117702"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$68F2B825-DDA8-443C-9CBC-CE79B5E49FBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f920763b5ff0f437bb9569e18effe602a4ecda49","datavalue":{"value":{"entity-type":"item","numeric-id":297869,"id":"Q297869"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$606B849A-F30D-4471-9A20-F89C162D297F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d4077ffb18414bbb2357751629d411d50e25c5a0","datavalue":{"value":{"entity-type":"item","numeric-id":345896,"id":"Q345896"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5117703$5DD9F481-E025-46AF-A5C9-96AC761B8E88","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7d4f132e262cfd90bc6820d79fa2935957d2a6e3","datavalue":{"value":{"time":"+2020-08-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5117703$2B9AE3D9-8BEE-4881-A349-C4F38CE3AB05","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"08d6627ae2c019bef2c123de72ca8195cdbf2423","datavalue":{"value":"68Q07","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5117703$ADD08D3D-CD86-4683-88B3-9B251D0C323D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"bca8a772cd4d226688dff67c52999a9570002101","datavalue":{"value":"7239973","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5117703$909BA0C1-0A45-49CF-981B-5033319BC61F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6eca7749aac65c9c8541ad51f82a6bba5d500afe","datavalue":{"value":"ant colony algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q5117703$08E38115-F1D7-428D-9BF8-E4FCC23A4BE3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8cb38e702e6a9b38b5766b9bed8789ba9523673a","datavalue":{"value":"robot path planning","type":"string"},"datatype":"string"},"type":"statement","id":"Q5117703$420874FC-4FE0-4DD0-80D2-AB5EADFD6016","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"51c98fd10e3d562a8fb1d217e5fee31ddc14fdb8","datavalue":{"value":"grid map","type":"string"},"datatype":"string"},"type":"statement","id":"Q5117703$E9A4E14A-1902-47C0-A364-A28E50A0DB11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c2df4be61b42c15be02a284667cc79d17284cd8","datavalue":{"value":"global optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5117703$BD4E38C5-D403-4A71-B24A-B00068460A67","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":"Q5117703$38FE6D72-1FF0-46A6-B798-F185E12272CA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7bbe225dff91d2c3fa7c14049a6ed9a1b5e93ca1","datavalue":{"value":"https://doi.org/10.1007/978-981-15-3425-6_8","type":"string"},"datatype":"url"},"type":"statement","id":"Q5117703$89E38383-10E2-47A6-ACC0-41189666C003","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"5260f6c48f043459a40fb47f886f6c35e34ee28f","datavalue":{"value":"W3014872989","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5117703$F2CB9D07-D84D-4C9E-A754-F256AB73821C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Ant Colony Algorithm Based on Upper Bound of Nodes for Robot Path Planning Problems","badges":[]}}}}}